Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs

DOI10.1007/978-3-642-13036-6_30zbMath1284.05261OpenAlexW1605294700MaRDI QIDQ3569834

Edoardo Amaldi, Romeo Rizzi, Claudio Iuliano

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Minimum strictly fundamental cycle bases of planar graphs are hard to find ⋮ Rooted Cycle Bases ⋮ Lane covering with partner bounds in collaborative truckload transportation procurement ⋮ Testing connectivity of faulty networks in sublinear time ⋮ Characterization of minimum cycle basis in weighted partial 2-trees ⋮ Properties of Gomory-Hu co-cycle bases

This page was built for publication: Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs