DBScholar

Back to papers

Efficient Core Maintenance in Large Bipartite Graphs

Summary: Introduces bi-core numbers for bipartite graphs and analyzes how edge updates alter vertex bi-core values, narrowing updates. Proposes fast (alpha,beta)-core maintenance for insertions/deletions; experiments show up to 100x speedup over prior work. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6774
Venue
SIGMOD
Year
2023
Pagerank
6.1255689e-05
Overall Rank
5,674 | 61.08%
DOI
10.1145/3617329

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{luo_sigmod23,
        title = {{Efficient Core Maintenance in Large Bipartite Graphs}},
        author = {Luo, Wensheng and Yang, Qiaoyuan and Fang, Yixiang and Zhou, Xu},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3617329},
        url = {https://dl.acm.org/doi/10.1145/3617329},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers