Cycle bases in graphs characterization, algorithms, complexity, and applications

Computer Science Review

Volumn 3, Issue 4, 2009, Pages 199-243

  Kavitha, Telikepalli ^a   Liebchen, Christian ^b   Mehlhorn, Kurt ^c   Michail, Dimitrios ^d   Rizzi, Romeo ^e   Ueckerdt, Torsten ^f   Zweig, Katharina A ^g  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b Zentrale Frankfurt am Main   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d HAROKOPIO UNIVERSITY   (Greece)

^e UNIVERSITY OF UDINE   (Italy)

^f TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^g EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL AND BIOLOGICALS; CYCLE MATRIXES; ELECTRICAL NETWORKS; GRAPH DRAWING; MINIMUM CYCLE BASIS; PERIODIC SCHEDULING; POLYNOMIAL ALGORITHM; RICH STRUCTURE;

ALGORITHMS; CHEMICAL ANALYSIS; DRAWING (GRAPHICS); ELECTRIC NETWORK ANALYSIS;

GRAPH THEORY;

EID: 70349994106     PISSN: 15740137     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cosrev.2009.08.001     Document Type: Article

References (77)

1. MacLane S. A combinatorial condition for planar graphs. Fund. Math. 28 (1937) 22-32
2. Liebchen C., and Rizzi R. Classes of cycle bases. Discrete Appl. Math. 155 3 (2007) 337-355
3. 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 715-726
4. T. Ueckerdt, Berechnung kurzer ganzzahliger Kreisbasen in Graphen, Master's Thesis, Technische Universität Berlin, 2008
5. Schrijver A. Theory of Linear and Integer Programming (1986), Wiley
6. Sysło M.M. On cycle bases of a graph. Networks 9 (1979) 123-132
7. Hartvigsen D., and Zemel E. Is every cycle basis fundamental?. J. Graph Theory 13 1 (1989) 117-137
8. 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
9. Champetier C. On the null-homotopy of graphs. Discrete Mathematics 64 (1987) 97-98
10. P.M. Gleiss, Short cycles - minimum cycle bases of graphs from Chemistry and Biochemistry, Ph.D. Thesis, Fakultät für Naturwissenschaften und Mathematik der Universität Wien, 2001
11. Apostol T. Introduction to Analytic Number Theory (1997), Springer
12. Horton J. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Comput. 16 (1987) 359-366
13. Kavitha T., and Krishna K.V. An improved heuristic for computing short integral cycle bases. ACM J. Exp. Algorithmics 13 (2008)
14. J.C. de Pina, Applications of Shortest-Path Methods, Ph.D. Thesis, Universiteit van Amsterdam, 1995
15. A. Reich, Streng fundamentale Kreisbasen planarer Graphen, Master's Thesis, Mathematisches Institut der Brandenburgischen Technischen Universität Cottbus, 2007
16. Lubotzky A., Phillips R., and Sarnak P. Ramanujan graphs. Combinatorica 3 (1988) 261-277
17. Rizzi R. Minimum weakly fundamental cycle bases are hard to find. Algorithmica (2007) 10.1007/s00453-007-9112-8 online first
18. Bollobás B. Extremal Graph Theory (1978), Academic Press, New York
19. M. Kaufmann, D. Michail, Personal communication, 2008
20. Alon N., Hoory S., and Linial N. The Moore bound for irregular graphs. Graphs Combin. 18 1 (2002) 53-57
21. Miller G. Finding small simple cycle separators for 2-connected planar graphs. J. Comp. Syst. Sci. 32 (1986) 265-279
22. J.M. Stern, S.A. Vavasis, Nested dissection for sparse nullspace bases, Technical report, Department of Computer Science, Cornell University, Ithaca, 1990
23. Alon N., Karp R.M., Peleg D., and West D.B. A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24 1 (1995) 78-100
24. Köhler E., Liebchen C., Rizzi R., and Wünsch G. Lower bounds for strictly fundamental cycle bases in grid graphs. Networks 53 2 (2009)
25. Peleg D. Distributed computing - a locality sensitive approach. SIAM Monogr. Discrete Math. Appl. (2000)
26. Elkin M., Emek Y., Spielman D.A., and Teng S.-H. Lower-stretch spanning trees. SIAM J. Comput. 38 2 (2008) 608-628
27. Deo N., Prabhu G.M., and Krishnamoorthy M. Algorithms for generating fundamental cycles in a graph. ACM Trans. Math. Softw. 8 1 (1982) 26-42
28. Elkin M., Liebchen C., and Rizzi R. New length bounds for cycle bases. Inf. Process. Lett. 104 5 (2007) 186-193
29. I. Abraham, Y. Bartal, O. Neiman, Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion, in: SODA, 2007, pp. 502-511
30. Korte B., and Vygen J. Combinatorial Optimization (2005), Springer
31. K. Mehlhorn, D. Michail, Minimum cycle bases: Faster and simpler, ACM Trans. Algorithms (2008) (in press)
32. Liebchen C., and Rizzi R. A greedy approach to compute a minimum cycle basis of a directed graph. Inf. Process. Lett. 94 3 (2005) 107-112
33. Bafna V., Berman P., and Fujito T. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12 3 (1999) 289-297
34. 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 200-209
35. Berger F., Gritzmann P., and de Vries S. Minimum cycle bases for network graphs. Algorithmica 40 (2004) 51-62
36. Kavitha T., Mehlhorn K., Michail D., and Paluch K.E. A faster algorithm for minimum cycle bases of graphs. In: Díaz J., Karhumäki J., Lepistö A., and Sannella D. (Eds). ICALP. Lecture Notes in Computer Science vol. 3142 (2004), Springer 846-857
37. Hariharan R., Kavitha T., and Mehlhorn K. A faster deterministic algorithm for minimum cycle bases in directed graphs. In: Bugliesi M., Preneel B., Sassone V., and Wegener I. (Eds). ICALP (1). Lecture Notes in Computer Science vol. 4051 (2006), Springer 250-261
38. Kavitha T., Mehlhorn K., and Michail D. New approximation algorithms for minimum cycle bases of graphs. In: Thomas W., and Weil P. (Eds). STACS. Lecture Notes in Computer Science vol. 4393 (2007), Springer 512-523
39. 2 n) barrier for minimum cycle bases. LNCS vol. 5757 (2009) 301-312. http://www.mpi-inf.mpg.de/~mehlhorn/ftp/BarrierCycleBasis.pdf
40. Berger F., Flamm C., Gleiss P.M., Leydold J., and Stadler P.F. Counterexamples in chemical ring perception. J. Chem. Inform. Comput. Sci. 44 2 (2004) 323-331
41. Barahona F., and Mahjoub A.R. On the cut polytope. Math. Program. 36 (1986) 157-173
42. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988), Springer
43. Kavitha T., and Mehlhorn K. A polynomial time algorithm for minimum cycle bases in directed graphs. In: Diekert V., and Durand B. (Eds). STACS. Lecture Notes in Computer Science vol. 3404 (2005), Springer 654-665
44. H. Gabow, Data structures for weighted matching and nearest common ancestor with linking, in: SODA, 1990, pp. 434-443
45. Hartvigsen D., and Mardon R. The all-pairs min cut problem and the minimum cycle basis problem on planar graphs. SIAM J. Discrete Math. 7 3 (1994) 403-418
46. Pettie S. A new approach to all-pairs shortest paths on real-weighted graphs. Theoret. Comput. Sci. 312 1 (2004) 47-74
47. Frederickson G. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16 (1987) 1004-1022
48. Thorup M. Undirected single-source shortest paths with positive integer weights in linear time. JACM 46 (1999) 362-394
49. Althöfer I., Das G., Dobkin D., Joseph D., and Soares J. On sparse spanners of weighted graphs. Discrete Comput. Geom. 9 1 (1993) 81-100
50. M. Thorup, U. Zwick, Approximate distance oracles, in: ACM Symposium on Theory of Computing, 2001, pp. 183-192
51. M. Thorup, U. Zwick, Compact routing schemes, in: Proceedings of 13th ACM Symposium on Parallel Algorithms and Architecture, 2001, pp. 1-10
52. P.M. Gleiss, Cycdeco, 2001. http://www.tbi.univie.ac.at/~pmg/cycdeco/cycdeco.html
53. M. Huber, Implementation of algorithms for sparse cycle bases of graphs, 2003. http://www-m9.ma.tum.de/dm/cycles/mhuber
54. F. Berger, Kreisbasenbibliothek CyBaL, 2004. http://www-m9.ma.tum.de/m9old/dm/projects/cycles/cybal/
55. U. Bauer, Minimum cycle basis algorithms for the chemistry development toolkit, 2004. http://geom.mi.fu-berlin.de/ubauer/CDK-Ringsearch.pdf
56. Mehlhorn K., and Michail D. Implementing minimum cycle basis algorithms. ACM J. Experimental Algorithms 11 (2006) 1-14
57. Vismara P. Union of all the minimum cycle bases of a graph. Electron. J. Combin. 4 1 (1997) 73-87
58. Papadimitriou C.M. Computational Complexity (1994), Addison-Wesley
59. L. Trevisan, Inapproximability of combinatorial optimization problems. Electronic Colloquium on Computational Complexity (ECCC), 2004
60. G. Galbiati, R. Rizzi, E. Amaldi, On the approximability of the minimum strictly fundamental cycle bases problem, 2007 (submitted for publication)
61. Alimonti P., and Kann V. Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237 1-2 (2000) 123-134
62. Galbiati G. On finding cycle bases and fundamental cycle bases with a shortest maximal cycle. Inf. Process. Lett. 88 4 (2003) 155-159
63. Fekete S.P., and Kremer J. Tree spanners in planar graphs. Discrete Appl. Math. 108 1-2 (2001) 85-103
64. Kirchhoff G. Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Annal. Phys. Chem. 72 12 (1847) 497-508
65. Bollobás B. Modern Graph Theory. Graduate Texts in Mathematics vol. 184 (2002), Springer
66. S. Bächle, Numerical solution of differential-algebraic systems arising in circuit simulation, Ph.D. Thesis, Technische Universität Berlin, 2007
67. Gartner N.H., Little J.D., and Gabbay H. Optimization of traffic signal settings by mixed-integer linear programming, Part I: The network coordination problem. Transp. Sci. 9 (1975) 321-343
68. Rüger S. Transporttechnologie städtischer öffentlicher Personenverkehr (1986), Transpress, Verlag für Verkehrswesen
69. Serafini P., and Ukovich W. A mathematical model for periodic scheduling problems. SIAM J. Discrete Math. 2 4 (1989) 550-581
70. G. Wünsch, Coordination of traffic signals in networks and related graph theoretical problems on spanning trees, Ph.D. Thesis, Technische Universität Berlin, Institute of Mathematics, 2008
71. Nachtigall K. Periodic network optimization with different arc frequencies. Discrete Appl. Math. 69 1-2 (1996) 1-17
72. Liebchen C., and Peeters L. Integral cycle bases for cyclic timetabling. Discrete Optim. 6 1 (2009) 98-109
73. Liebchen C. The first optimized railway timetable in practice. Transp. Sci. 42 4 (2008) 420-435
74. L. Kroon, D. Huisman, E. Abbink, P.-J. Fioole, M. Fischetti, G. Maróti, L. Schrijver, A. Steenbeek, R. Ybema, The new Dutch timetable: The OR revolution, Technical Report EI2008-19, Erasmus University Rotterdam, Econometric Institute. (Accepted for publication in Interfaces as winning paper of the 2008 INFORMS Franz Edelman Award, 2008)
75. K.A. Lehmann, S. Kottler, Visualizing large and complex networks, in: Proceedings of the 14th International Symposium on Graph Drawing, GD'06, 2007
76. Watts D.J., and Strogatz S.H. Collective dynamics of 'small-world' networks. Nature 393 (1998) 440-442
77. In: Kaufmann M., and Wagner D. (Eds). Drawing Graphs. Lecture Notes in Computer Science vol. 2025 (2001), Springer