Concept

Distance-hereditary graph

OpenAlex ID: C147792647

Limits of dense graph sequences

2006 · László Lovász, Balázs Szegedy · Journal of Combinatorial Theory Series B · 802

PDF

The intersection graphs of subtrees in trees are exactly the chordal graphs

1974 · Fǎnicǎ Gavril · Journal of Combinatorial Theory Series B · 691

PDF

On a relation between graph edit distance and maximum common subgraph

1997 · H. Bunke · Pattern Recognition Letters · 553

Efficient subgraph matching on billion node graphs

2012 · Zhao Sun, Hongzhi Wang, et al. · Proceedings of the VLDB Endowment · 369

PDF

Fast discovery of connection subgraphs

2004 · Christos Faloutsos, Kevin S. McCurley, et al. · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · 353

A new algorithm for error-tolerant subgraph isomorphism detection

1998 · B.T. Messmer, H. Bunke · IEEE Transactions on Pattern Analysis and Machine Intelligence · 352

A characterization of perfect graphs

1972 · L Lovász · Journal of Combinatorial Theory Series B · 351

PDF

Closure-Tree: An Index Structure for Graph Queries

2006 · Huahai He, A.K. Singh · IEEE International Conference on Data Engineering (ICDE) · 309

Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design

2010 · Vicky Choi · Quantum Information Processing · 297

PDF

On a Closure Concept in Claw-Free Graphs

1997 · Zdeněk Ryjáček · Journal of Combinatorial Theory Series B · 297

PDF

Factorizable Net: An Efficient Subgraph-Based Framework for Scene Graph Generation

2018 · Yikang Li, Wanli Ouyang, et al. · Lecture notes in computer science · 293

PDF

Error correcting graph matching: on the influence of the underlying cost function

1999 · H. Bunke · IEEE Transactions on Pattern Analysis and Machine Intelligence · 233

Subgraph Matching Kernels for Attributed Graphs

2012 · Kriege, Nils, Mutzel, Petra · arXiv (Cornell University) · 229

PDF

Graph indexing: tree + delta <= graph

2007 · Peixiang Zhao, Jeffrey Xu Yu, et al. · 213

Circle Graph Obstructions

1994 · A. Bouchet · Journal of Combinatorial Theory Series B · 191

The Gaston Tool for Frequent Subgraph Mining

2005 · Siegfried Nijssen, Joost N. Kok · Electronic Notes in Theoretical Computer Science · 180

PDF

Graph Database Indexing Using Structured Graph Decomposition

2007 · David W. Williams, Jun Huan, et al. · IEEE International Conference on Data Engineering (ICDE) · 172

Supereulerian graphs: A survey

1992 · Paul A. Catlin · Journal of Graph Theory · 165

Graph distances using graph union

2001 · W.D. Wallis, P. Shoubridge, et al. · Pattern Recognition Letters · 160

Mining Frequent Subgraph Patterns from Uncertain Graph Data

2010 · Zhaonian Zou, Jianzhong Li, et al. · IEEE Transactions on Knowledge and Data Engineering · 155

Trivially perfect graphs

1978 · Martin Charles Golumbic · Discrete Mathematics · 154

PDF

Graph Anomaly Detection via Multi-Scale Contrastive Learning Networks with Augmented View

2023 · Jingcan Duan, Siwei Wang, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 150

PDF

SAPPER: subgraph indexing and approximate matching in large graphs

2010 · Shijie Zhang, Jiong Yang, et al. · Proceedings of the VLDB Endowment · 149

Planar Graphs Have Bounded Queue-Number

2020 · Vida Dujmović, Gwenaël Joret, et al. · Journal of the ACM · 144

PDF

NeMa: fast graph search with label similarity

2013 · Arijit Khan, Yinghui Wu, et al. · Proceedings of the VLDB Endowment · 139

Works count: 1,835

Citation count: 18,040