Efficiently Computing k-Edge Connected Components via Graph Decomposition

Authors

• 1. Lijun Chang (East China Normal University; University of New South Wales)
• 2. Jeffrey Xu Yu (Chinese University of Hong Kong)
• 3. Lu Qin (Chinese University of Hong Kong)
• 4. Xuemin Lin (East China Normal University; University of New South Wales)
• 5. Chengfei Liu (Swinburne University of Technology)
• 6. Weifa Liang (Australian National University)

@inproceedings{chang_sigmod13,
        title = {{Efficiently Computing k-Edge Connected Components via Graph Decomposition}},
        author = {Chang, Lijun and Yu, Jeffrey Xu and Qin, Lu and Lin, Xuemin and Liu, Chengfei and Liang, Weifa},
        series = {{SIGMOD} '13},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2463676.2465323},
        url = {https://dl.acm.org/doi/10.1145/2463676.2465323},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 22 of 22 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Semantically Similar Papers