New Approximation Algorithms for Minimum Cycle Bases of Graphs
From MaRDI portal
Publication:3590960
Recommendations
Cited in
(19)- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Minimum cycle bases, faster and simpler
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Approximation and Online Algorithms
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph
- Automata, Languages and Programming
- New length bounds for cycle bases
- On the approximability of the minimum strictly fundamental cycle basis problem
- Automata, Languages and Programming
- Cycle bases of graphs and sampled manifolds
- New approximation algorithms for minimum cycle bases of graphs
- Minimum cycle bases of weighted outerplanar graphs
- A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- Minimum Path Bases
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- Minimum Cycle Bases and Their Applications
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)
