New Approximation Algorithms for Minimum Cycle Bases of Graphs

DOI10.1007/978-3-540-70918-3_44zbMath1186.68561OpenAlexW1902117024MaRDI QIDQ3590960

Dimitrios Michail, Kurt Mehlhorn, Telikepalli Kavitha

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: http://edoc.mpg.de/356750

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (9)

New length bounds for cycle bases ⋮ Minimum cycle bases of weighted outerplanar graphs ⋮ New approximation algorithms for minimum cycle bases of graphs ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ Cycle bases of graphs and sampled manifolds ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs ⋮ Minimum Cycle Bases and Their Applications

This page was built for publication: New Approximation Algorithms for Minimum Cycle Bases of Graphs