A greedy approach to compute a minimum cycle basis of a directed graph

Information Processing Letters

Volumn 94, Issue 3, 2005, Pages 107-112

  Liebchen, Christian ^a   Rizzi, Romeo ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b Università Degli Studi Di T   (Italy)

Author keywords

Directed graphs; Graph algorithms; Greedy algorithm; Minimum cycle bases

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; VECTORS;

DIRECTED GRAPHS; GRAPH ALGORITHMS; GREEDY ALGORITHMS; MINIMUM CYCLE BASES;

GRAPH THEORY;

EID: 15344346236     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.01.006     Document Type: Article

References (15)

1. F. Berger, P. Gritzmann, and S. de Vries Minimum cycle bases for network graphs Algorithmica 40 1 2004 51 62
2. B. Bollobás Modern Graph Theory Grad. Texts Math. vol. 184 1998 Springer Berlin
3. J.C. de Pina, Applications of shortest path methods, Ph.D. Thesis, University of Amsterdam, The Netherlands, 1995
4. G. Galbiati, and E. Amaldi On the approximability of the minimum fundamental cycle basis problem K. Jansen R. Solis-Oba WAOA 2003 Lecture Notes in Comput. Sci. vol. 2909 2003 Springer Berlin 151 164
5. P.M. Gleiss, Short cycles: minimum cycle bases of graphs from chemistry and biochemistry, Ph.D. Thesis, Universität Wien, 2001
6. A. Golynski, A polynomial time algorithm to find the minimum cycle basis of a regular matroid, Master's thesis, University of New Brunswick, 2002
7. A. Golynski, and J.D. Horton A polynomial time algorithm to find the minimum cycle basis of a regular matroid M. Penttonen E. Meineche Schmidt SWAT 2002 Lecture Notes in Comput. Sci. vol. 2368 2002 Springer Berlin 200 209
8. J.D. Horton A polynomial-time algorithm to find the shortest cycle basis of a graph SIAM J. Comput. 16 1987 358 366
9. T. Kavitha, K. Mehlhorn, A polynomial time algorithm for minimum cycle basis in directed graphs, Kurt Mehlhorn's List of Publications, 185, MPI Saarbrücken, 2004, http://www.mpi-sb.mpg.de/~mehlhorn/ftp/DirCycleBasis.ps ; Proc. STACS 2005, submitted for publication
10. T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch A faster algorithm for minimum cycle basis of graphs J. Diaz ICALP 2004 Lecture Notes in Comput. Sci. vol. 3142 2004 Springer Berlin 846 857
11. C. Liebchen Finding short integral cycle bases for cyclic timetabling G. di Battista U. Zwick Algorithms 2003 Lecture Notes in Comput. Sci. vol. 2832 2003 Springer Berlin 715 726
12. C. Liebchen, L. Peeters, On cyclic timetabling and cycles in graphs, Technical Report 761/2002, TU Berlin, 2002
13. C. Liebchen, R. Rizzi, A greedy approach to compute a minimum cycle basis of a directed graph, Preprint 031/2004, TU Berlin, 2004
14. A. Schrijver, Personal communication, 2002
15. H. Whitney On the abstract properties of linear dependence Amer. J. Math. 57 1935 509 533