A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
From MaRDI portal
Publication:1969943
DOI10.1007/s004539910004zbMath0952.68114OpenAlexW2079573299MaRDI QIDQ1969943
Hiroshi Nagamochi, Toshihide Ibaraki, S. Nakamura
Publication date: 19 July 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004539910004
Related Items
Multigraph augmentation under biconnectivity and general edge-connectivity requirements, Graph connectivity and its augmentation: Applications of MA orderings, A fast algorithm for cactus representations of minimum cuts, Bipartition constrained edge-splitting in directed graphs, A new contraction technique with applications to congruency-constrained cuts