Growing a Graph Matching from a Handful of Seeds
Summary: Seed-efficient graph matching: algorithm operates with tiny seed sets, trading small accuracy loss for scalability. Phase-transition analysis via bootstrap percolation on random bigraphs; demonstrates strong performance on large real networks with few seeds. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ehsan Kazemi (EPFL)
- 2. S. Hamed Hassani (ETH Zurich)
- 3. Matthias Grossglauser (EPFL)
BibTeX Citation
@article{kazemi_vldb15,
title = {{Growing a Graph Matching from a Handful of Seeds}},
author = {Kazemi, Ehsan and Hassani, S. Hamed and Grossglauser, Matthias},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {10},
doi = {10.14778/2794367.2794371},
url = {https://doi.org/10.14778/2794367.2794371},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,899 | Reconciling Graphs and Sets of Sets | 2018 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,358 | An efficient reconciliation algorithm for social networks | 2014 | VLDB | 7.4900538e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,564 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 2 | 10,328 | Scaling Up k-Clique Percolation Community Detection | 2026 | SIGMOD |
| 3 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 4 | 5,484 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB |
| 5 | 3,908 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB |
| 6 | 2,718 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB |
| 7 | 1,296 | Incremental Graph Pattern Matching | 2011 | SIGMOD |
| 8 | 11,756 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 9 | 11,762 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 10 | 1,128 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |