New approximation algorithms for minimum cycle bases of graphs
From MaRDI portal
(Redirected from Publication:633843)
Recommendations
- New Approximation Algorithms for Minimum Cycle Bases of Graphs
- Minimum Cycle Bases in Graphs Algorithms and Applications
- Automata, Languages and Programming
- New approximation algorithms for the minimum cycle cover problem
- New approximation algorithms for the minimum cycle cover problem
- Algorithms for finding minimum fundamental cycle bases in graphs
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
- STACS 2005
Cites work
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
- A greedy approach to compute a minimum cycle basis of a directed graph
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Algorithms to compute minimum cycle basis in directed graphs
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- Approximate distance oracles
- Approximate distance oracles for unweighted graphs in expected \(O(n^2)\) time
- Automata, Languages and Programming
- Automata, Languages and Programming
- Classes of cycle bases
- Classes of graphs which approximate the complete Euclidean graph
- Cycle bases of minimal measure for the structural analysis of skeletal structures by the flexibility method
- Efficient Planarity Testing
- scientific article; zbMATH DE number 2089223 (Why is no real title available?)
- scientific article; zbMATH DE number 3839870 (Why is no real title available?)
- scientific article; zbMATH DE number 3243268 (Why is no real title available?)
- Implementing minimum cycle basis algorithms
- Introduction to algorithms.
- Matrix multiplication via arithmetic progressions
- Minimal cycle bases of outerplanar graphs
- Minimum cycle bases for network graphs
- Minimum weakly fundamental cycle bases are hard to find
- New Approximation Algorithms for Minimum Cycle Bases of Graphs
- On sparse spanners of weighted graphs
- The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
Cited in
(12)- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- New length bounds for cycle bases
- Minimum strictly fundamental cycle bases of planar graphs are hard to find
- New Approximation Algorithms for Minimum Cycle Bases of Graphs
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph
- A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
- Automata, Languages and Programming
- A direct method for calculating cell cycles of a block map of a simple planar graph
- Approximation and Online Algorithms
- On the approximability of the minimum strictly fundamental cycle basis problem
- Minimum cycle bases, faster and simpler
- Fast algorithms for minimum homology basis
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 Q633843)
