# Algorithms for Generating Fundamental Cycles in a Graph

@article{Deo1982AlgorithmsFG, title={Algorithms for Generating Fundamental Cycles in a Graph}, author={N. Deo and G. Prabhu and M. Krishnamoorthy}, journal={ACM Trans. Math. Softw.}, year={1982}, volume={8}, pages={26-42} }

The following problem is considered: Given an undirected, connected graph G, find a spanning tree in G such that the sum of the lengths of the fundamental cycles (with respect to this tree) is minimum. This problem, besides being interesting in its own right, is useful in a variety of situations It is shown that this problem is NP-complete. A number of polynomial-time, heuristic algorithms which yield "good" suboptimal solutions are presented and their performances are discussed. Finally, it is… Expand

#### 118 Citations

On the Approximability of the Minimum Fundamental Cycle Basis Problem

- Mathematics, Computer Science
- WAOA
- 2003

Minimum strictly fundamental cycle bases of planar graphs are hard to find

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2016

Edge-swapping algorithms for the minimum fundamental cycle basis problem

- Mathematics, Computer Science
- Math. Methods Oper. Res.
- 2009

Algorithms for finding minimum fundamental cycle bases in graphs

- Mathematics, Computer Science
- Electron. Notes Discret. Math.
- 2004

Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs

- Mathematics, Computer Science
- IPCO
- 2010

On the approximability of the minimum strictly fundamental cycle basis problem

- Mathematics, Computer Science
- Discret. Appl. Math.
- 2011