Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
From MaRDI portal
Publication:1383804
DOI10.1023/A:1009739202898zbMath0895.90172OpenAlexW1483203801MaRDI QIDQ1383804
Toshihide Ibaraki, Hiroshi Nagamochi
Publication date: 13 April 1998
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009739202898
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (8)
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs ⋮ Augmenting the connectivity of outerplanar graphs ⋮ An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Augmenting the connectivity of geometric graphs ⋮ Multigraph augmentation under biconnectivity and general edge-connectivity requirements ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Polyhedral structure of submodular and posi-modular systems
This page was built for publication: Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
