Minimum Weakly Fundamental Cycle Bases Are Hard To Find

@article{Rizzi2007MinimumWF,
  title={Minimum Weakly Fundamental Cycle Bases Are Hard To Find},
  author={R. Rizzi},
  journal={Algorithmica},
  year={2007},
  volume={53},
  pages={402-424}
}
  • R. Rizzi
  • Published 2007
  • Computer Science, Mathematics
  • Algorithmica
Abstract In the last years, new variants of the minimum cycle basis (MCB) problem and new classes of cycle bases have been introduced, as motivated by several applications from disparate areas of scientific and technological inquiry. At present, the complexity status of the MCB problem is settled only for undirected, directed, and strictly fundamental cycle bases (SFCB’s). Weakly fundamental cycle bases (WFCB’s) form a natural superclass of SFCB’s. A cycle basis $\mathcal{C}=\{C_{1},C_{2… Expand
22 Citations
New Approximation Algorithms for Minimum Cycle Bases of Graphs
On a Special Co-cycle Basis of Graphs
On the approximability of the minimum strictly fundamental cycle basis problem
Properties of Gomory-Hu co-cycle bases
  • T. Kavitha
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2012
Minimum cycle bases: Faster and simpler
Rooted Cycle Bases
New Approximation Algorithms for Minimum Cycle Bases of Graphs
Cycle bases in graphs characterization, algorithms, complexity, and applications
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
Rooted Cycle Bases
...
1
2
3
...

References

SHOWING 1-10 OF 36 REFERENCES
Classes of cycle bases
New length bounds for cycle bases
On the Approximability of the Minimum Fundamental Cycle Basis Problem
A Faster Algorithm for Minimum Cycle Basis of Graphs
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
Minimum Cycle Bases for Network Graphs
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
  • J. Horton
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1987
A greedy approach to compute a minimum cycle basis of a directed graph
Packing cycles in undirected graphs
Algorithms for Generating Fundamental Cycles in a Graph
...
1
2
3
4
...