New Approximation Algorithms for Minimum Cycle Bases of Graphs

@inproceedings{Kavitha2007NewAA,
  title={New Approximation Algorithms for Minimum Cycle Bases of Graphs},
  author={T. Kavitha and K. Mehlhorn and D. Michail},
  booktitle={STACS},
  year={2007}
}
We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0, 1} incidence vector is associated with each cycle and the vector space over F2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum… Expand
New Approximation Algorithms for Minimum Cycle Bases of Graphs
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
Efficient approximation algorithms for shortest cycles in undirected graphs
Minimum cycle bases of weighted outerplanar graphs
Minimum Cycle Bases of Weighted Outerplanar Graphs
Convex cycle bases
Minimum cycle bases
Minimum Cycle Bases and Their Applications

References

SHOWING 1-10 OF 32 REFERENCES
Algorithms to Compute Minimum Cycle Basis in Directed Graphs
An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
A Faster Algorithm for Minimum Cycle Basis of Graphs
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
  • J. Horton
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1987
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
A greedy approach to compute a minimum cycle basis of a directed graph
Minimum Cycle Bases for Network Graphs
When Do Short Cycles Generate the Cycle Space?
...
1
2
3
4
...