New Approximation Algorithms for Minimum Cycle Bases of Graphs
From MaRDI portal
Publication:3590960
DOI10.1007/978-3-540-70918-3_44zbMATH Open1186.68561OpenAlexW1902117024MaRDI QIDQ3590960FDOQ3590960
Authors: Telikepalli Kavitha, K. Mehlhorn, Dimitrios Michail 
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: http://edoc.mpg.de/356750
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Paths and cycles (05C38)
Cited In (19)
- Approximation and Online Algorithms
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Automata, Languages and Programming
- On the approximability of the minimum strictly fundamental cycle basis problem
- New approximation algorithms for minimum cycle bases of graphs
- Automata, Languages and Programming
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Minimum Cycle Bases and Their Applications
- Minimum cycle bases, faster and simpler
- Cycle bases of graphs and sampled manifolds
- A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- New length bounds for cycle bases
- Minimum Path Bases
- Minimum cycle bases of weighted outerplanar graphs
This page was built for publication: New Approximation Algorithms for Minimum Cycle Bases of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590960)
