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
LOCAL SEARCH FOR THE MINIMUM FUNDAMENTAL CYCLE BASIS PROBLEM
On the Approximability of the Minimum Fundamental Cycle Basis Problem
Minimum strictly fundamental cycle bases of planar graphs are hard to find
Edge-swapping algorithms for the minimum fundamental cycle basis problem
Algorithms for finding minimum fundamental cycle bases in graphs
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
Minimum cut bases in undirected networks
On Min-Max Cycle Bases
The Complexity of Computing Graph-Approximating Spanning Trees
On the approximability of the minimum strictly fundamental cycle basis problem
...
1
2
3
4
5
...