DBScholar

Back to papers

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)

Paper ID
11170
Venue
VLDB
Year
2015
Pagerank
5.6029996e-05
Overall Rank
7,520 | 48.41%
DOI
10.14778/2794367.2794371

Incoming Non-self Citations Over Time

Authors

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