Graph Pattern Matching: From Intractable to Polynomial Time
Summary: Recasts graph pattern matching from NP-complete subgraph isomorphism to bounded simulation, where edges represent bounded-hop connectivity. Delivers cubic-time matching and update algorithms (with DAG guarantees), enabling scalable community discovery. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wenfei Fan (Harbin Engineering University; University of Edinburgh)
- 2. Jianzhong Li (Harbin Engineering University)
- 3. Shuai Ma (University of Edinburgh)
- 4. Nan Tang (University of Edinburgh)
- 5. Yinghui Wu (University of Edinburgh)
- 6. Yunpeng Wu (National University of Defense Technology)
BibTeX Citation
@article{fan_vldb10,
title = {{Graph Pattern Matching: From Intractable to Polynomial Time}},
author = {Fan, Wenfei and Li, Jianzhong and Ma, Shuai and Tang, Nan and Wu, Yinghui and Wu, Yunpeng},
journal = {PVLDB},
series = {{VLDB} '10},
volume = {3},
number = {1},
pages = {264--275},
doi = {10.14778/1920841.1920876},
url = {https://doi.org/10.14778/1920841.1920876},
year = {2010}
}Incoming Citations (Sorted by Pagerank)
Showing 34 of 34 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 178 | Holistic Twig Joins: Optimal XML Pattern Matching | 2002 | SIGMOD | 0.00026628894 |
| 192 | Algorithmics and Applications of Tree and Graph Searching | 2002 | PODS | 0.00025659453 |
| 274 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022490994 |
| 288 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00021969641 |
| 453 | Stack-based Algorithms for Pattern Matching on DAGs | 2005 | VLDB | 0.00017972038 |
| 783 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00014021799 |
| 2,773 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 8.0351713e-05 |
| 3,805 | Finding replicated web collections | 2000 | SIGMOD | 7.0118055e-05 |
| 5,816 | Incremental Maintenance of XML Structural Indexes | 2004 | SIGMOD | 5.9844725e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 960 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 2 | 7,666 | Growing a Graph Matching from a Handful of Seeds | 2015 | VLDB |
| 3 | 7,478 | Extending Graph Patterns with Conditions | 2020 | SIGMOD |
| 4 | 2,773 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB |
| 5 | 3,979 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB |
| 6 | 4,583 | Event Pattern Matching over Graph Streams | 2015 | VLDB |
| 7 | 12,059 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 8 | 12,065 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 9 | 5,605 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB |
| 10 | 1,317 | Incremental Graph Pattern Matching | 2011 | SIGMOD |