Database Paper Browser

Back to papers

Capturing Topology in Graph Pattern Matching

Summary: Proposes strong simulation, a topology-preserving graph pattern matching notion that bounds matches and fixes topology gaps of prior simulation variants. Cubic-time algorithm; locality for distributed graphs; validated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10481
Venue
VLDB
Year
2012
Pagerank
5.3256482e-05
Overall Rank
5,786 | 59.79%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
2,557 NeMa: Fast Graph Search with Label Similarity 2013 VLDB 8.5484449e-05
4,207 Querying Big Graphs within Bounded Resources 2014 SIGMOD 6.3519481e-05
5,017 Event Pattern Matching over Graph Streams 2015 VLDB 5.7505967e-05
5,903 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 5.2757528e-05
6,119 Distributed Graph Simulation: Impossibility and Possibility 2014 VLDB 5.1991813e-05
8,209 Mining Top-k Pairs of Correlated Subgraphs in a Large Network 2020 VLDB 4.5537353e-05
11,569 Simulation-based Approximate Graph Pattern Matching 2020 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers