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: 10982
Venue: VLDB
Year: 2015
Pagerank: 4.1945683e-05
Overall Rank: 11,926 | 17.04%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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,032	An efficient reconciliation algorithm for social networks	2014	VLDB	7.6762757e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,308	Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching	2026	VLDB	4.1945683e-05
10,033	Scaling Up k-Clique Percolation Community Detection	2026	SIGMOD	4.1945683e-05
651	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018648572
5,776	Capturing Topology in Graph Pattern Matching	2012	VLDB	5.3309758e-05
4,807	Diversified Top-k Graph Pattern Matching	2013	VLDB	5.9092289e-05
2,938	Graph Homomorphism Revisited for Graph Matching	2010	VLDB	7.8524059e-05
1,720	Incremental Graph Pattern Matching	2011	SIGMOD	0.00010779343
11,559	Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees	2020	SIGMOD	4.1945683e-05
11,565	Simulation-based Approximate Graph Pattern Matching	2020	SIGMOD	4.1945683e-05
1,414	Graph Pattern Matching: From Intractable to Polynomial Time	2010	VLDB	0.00012118275