Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities

DOI10.1137/100790239zbMath1272.05204OpenAlexW1967476329MaRDI QIDQ5891168

Chun Kong Yung, Lap Chi Lau

Publication date: 25 September 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100790239

zbMATH Keywords

graph algorithmsedge connectivitysplitting off

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (3)

On Element-Connectivity Preserving Graph Simplification ⋮ Enumerating \(k\)-arc-connected orientations ⋮ A new contraction technique with applications to congruency-constrained cuts

This page was built for publication: Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities