Efficiently Computing k-Edge Connected Components via Graph Decomposition

Publisher:
ACM
Publication Type:
Conference Proceeding
Citation:
Proceedings of ACM Conference on Management of Data, 2013, pp. 205 - 216
Issue Date:
2013-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013002434OK.pdf547.94 kB
Adobe PDF
k-edge connected components; graph decomposition; minimum cut
Please use this identifier to cite or link to this item: