1. Algorithms for Generating Fundamental Cycles in a Graph;Deo;ACM Trans. Math. Software,1982
2. N. Deo, N. Kumar, and J. Parsons. Minimum-Length Fundamental-Cycle Set Problem: A New Heuristic and an SIMD Implementation. Technical Report CS-TR-95-04, Univ. Central Florida, Orlando, 1995
3. Is Every Cycle Basis Fundamental?;Hartvigsen;Journal of Graph Theory,1989
4. A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph;Horton;SIAM J. Comput,1987
5. A Cycle Based Optimization Model for the Cyclic Railway Timetabling Problem;Kroon,2001