Classes of cycle bases

Discrete Applied Mathematics

Volumn 155, Issue 3, 2007, Pages 337-355

  Liebchen, Christian ^a   Rizzi, Romeo ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Combinatorial optimization; Graphs; Minimum cycle basis problem

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; LINEAR TIME ALGORITHMS; MINIMUM CYCLE BASIS (MCB) PROBLEM;

PROBLEM SOLVING;

EID: 33751327777     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.06.007     Document Type: Article

References (32)

1. Amaldi E., Liberti L., Maculan N., and Maffioli F. Efficient edge-swapping heuristics for finding minimum fundamental cycle bases. In: Ribeiro C.C., and Martins S.L. (Eds). WEA, Lecture Notes in Computer Science vol. 3059 (2004), Springer, Berlin 14-29
2. Berge C. The Theory of Graphs and its Applications (1962), Wiley, New York
3. Berger F., Gritzmann P., and de Vries S. Minimum cycle bases for network graphs. Algorithmica 40 1 (2004) 51-62
4. B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, vol. 184, Springer, Berlin, 2002, 2nd printing.
5. Champetier C. On the null-homotopy of graphs. Discrete Math. 64 (1987) 97-98
6. Deo N., Krishnomoorthy M., and Prabhu G. Algorithms for generating fundamental cycles in a graph. ACM Trans. Math. Software 8 1 (1982) 26-42
7. R. Diestel, Graph Theory, second ed., Graduate Texts in Mathematics, vol. 173, Springer, Berlin, 2000.
8. Fekete S.P., and Kremer J. Tree spanners in planar graphs. Discrete Appl. Math. 108 1-2 (2001) 85-103
9. Galbiati G., and Amaldi E. On the approximability of the minimum fundamental cycle basis problem. In: Jansen K., and Solis-Oba R. (Eds). WAOA, Lecture Notes in Computer Science vol. 2909 (2003), Springer, Berlin 151-164
10. P.M. Gleiss, Short cycles, Ph.D. Thesis, Universität Wien, 2001, 〈http://www.tbi.univie.ac.at/papers/Abstracts/pmg_diss.pdf〉.
11. Golynski A., and Horton J.D. A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In: Penttonen M., and Schmidt E.M. (Eds). SWAT, Lecture Notes in Computer Science vol. 2368 (2002), Springer, Berlin 200-209
12. Gutwenger C., and Mutzel P. A linear time implementation of SPQR-trees. In: Marks J. (Ed). Graph Drawing, Lecture Notes in Computer Science vol. 1984 (2000), Springer, Berlin 77-90
13. R. Hariharan, T. Kavitha, K. Mehlhorn, A faster deterministic algorithm for minimum cycle bases in directed graphs, Kurt Mehlhorn's List of Publications 191, Max-Planck-Institute Saarbrücken, 2005, 〈http://www.mpi-sb.mpg.de/mehlhorn/ftp/ImprovedDirCycleBasis.ps 〉.
14. Hopcroft J.E., and Tarjan R.E. Efficient planarity testing. J. ACM 21 4 (1974) 549-568
15. Horton J.D. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Comput. 16 2 (1987) 358-366
16. Hubicka E., and Sysło M.M. Minimal bases of cycles of a graph. In: Fiedler M. (Ed). Recent Advances in Graph Theory (1975), Academia Praha 283-293
17. Kavitha T., and Mehlhorn K. A polynomial time algorithm for minimum cycle basis in directed graphs. In: Diekert V., and Durand B. (Eds). STACS, Lecture Notes in Computer Science vol. 3404 (2005), Springer, Berlin 654-665
18. Kavitha T., Mehlhorn K., Michail D., and Paluch K.E. A faster algorithm for minimum cycle basis of graphs. In: Diaz J., Karhumäki J., Lepistö A., and Sanella D. (Eds). ICALP, Lecture Notes in Computer Science vol. 3142 (2004), Springer, Berlin 846-857
19. Liebchen C. Finding short integral cycle bases for cyclic timetabling. In: Battista G.D., and Zwick U. (Eds). ESA, Lecture Notes in Computer Science vol. 2832 (2003), Springer, Berlin 715-726
20. C. Liebchen, L.W. Peeters, On cyclic timetabling and cycles in graphs, Technical Report 761-2002, TU Berlin, Mathematical Institute, 2002, 〈ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-761-2002.pd f〉.
21. Liebchen C., and Rizzi R. A greedy approach to compute a minimum cycle basis of a directed graph. Inform. Process. Lett. 94 3 (2005) 107-112
22. J. Leydold, P. F. Stadler, Minimal cycle bases of outerplanar graphs, Electron. J. Combin. 5.
23. MacLane S. A combinatorial condition for planar graphs. Fund. Math. 28 (1937) 22-32
24. R.E. Mardon, Optimal cycle and cut bases in graphs, Ph.D. Thesis, Northwestern University Evanston, Illinois, 1990.
25. Mohar B., and Thomassen C. Graphs on Surfaces (2001), Johns Hopkins University Press, Baltimore, MD
26. Nishizeki T., and Chiba N. Planar graphs: theory and algorithms, Annals of Discrete Mathematics vol. 32 (1988), North-Holland Publishing Co., Amsterdam
27. H. Poincaré, Second complément à l'analysis situs, Proc. London Math. Soc. 32 (1900) 277-308, reprinted in: Œuvres de Henri Poincaré, Tome VI, Gauthier-Villars, Paris, 1953, pp. 338-370.
28. Schrijver A. Theory of Linear and Integer Programming (1986), Wiley, New York
29. Sysło M.M. On cycle bases of a graph. Networks 9 (1979) 123-132
30. R. Weiskircher, New applications of SPQR-trees in graph drawing, Ph.D. Thesis, Universität des Saarlandes, 2002, 〈http://www.ads.tuwien.ac.at/people/Weiskircher/Diz.pdf.gz〉.
31. Whitney H. Non-separable and planar graphs. Trans. Amer. Math. Soc. 34 (1932) 339-362
32. Whitney H. On the abstract properties of linear dependence. Amer. J. Math. 57 (1935) 509-533