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: 10983
Venue: VLDB
Year: 2015
Pagerank: 4.1905499e-05
Overall Rank: 11,934 | 17.06%
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,002	An efficient reconciliation algorithm for social networks	2014	VLDB	7.7383442e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,276	gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs	2026	VLDB	4.1905499e-05
10,033	Scaling Up k-Clique Percolation Community Detection	2026	SIGMOD	4.1905499e-05
648	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018688754
5,786	Capturing Topology in Graph Pattern Matching	2012	VLDB	5.3256482e-05
4,748	Diversified Top-k Graph Pattern Matching	2013	VLDB	5.9432853e-05
2,943	Graph Homomorphism Revisited for Graph Matching	2010	VLDB	7.8463193e-05
1,806	Incremental Graph Pattern Matching	2011	SIGMOD	0.00010478244
11,563	Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees	2020	SIGMOD	4.1905499e-05
11,569	Simulation-based Approximate Graph Pattern Matching	2020	SIGMOD	4.1905499e-05
1,419	Graph Pattern Matching: From Intractable to Polynomial Time	2010	VLDB	0.00012072488