DBScholar

Back to papers

An efficient reconciliation algorithm for social networks

Summary: Formalizes cross-network identity reconciliation, with a simple, local parallel algorithm using few seed links to merge accounts. Provides strong guarantees on Random Graphs and Preferential Attachment; validated on synthetic and real networks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11104
Venue
VLDB
Year
2014
Pagerank
7.4900538e-05
Overall Rank
3,358 | 76.97%
DOI
10.14778/2735479.2735484

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{korula_vldb14,
        title = {{An efficient reconciliation algorithm for social networks}},
        author = {Korula, Nitish and Lattanzi, Silvio},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {5},
        pages = {377--388},
        doi = {10.14778/2735479.2735484},
        url = {https://doi.org/10.14778/2735479.2735484},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
3,251 Keys for Graphs 2015 VLDB 7.5963955e-05
7,520 Growing a Graph Matching from a Handful of Seeds 2015 VLDB 5.6029996e-05
11,791 SLIM: Scalable Linkage of Mobility Data 2020 SIGMOD 5.093636e-05
11,899 Reconciling Graphs and Sets of Sets 2018 PODS 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers