An Õ (m 2n) algorithm for minimum cycle basis of graphs

Algorithmica (New York)

Volumn 52, Issue 3, 2008, Pages 333-349

  Kavitha, Telikepalli ^a   Mehlhorn, Kurt ^b   Michail, Dimitrios ^b   Paluch, Katarzyna E ^c  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF WROC AW   (Poland)

Author keywords

Cycle basis; Cycle space; Matrix multiplication; Polynomial algorithms

Indexed keywords

CYCLE BASIS; CYCLE SPACE; CYCLE SPACES; DENSE GRAPHS; EDGE WEIGHTS; ELECTRICAL NETWORKS; MATRIX MULTIPLICATION; MATRIX MULTIPLICATIONS; MINIMUM CYCLE BASIS; OF GRAPHS; POLYNOMIAL ALGORITHMS; RUNNING TIMES; STRUCTURAL ENGINEERINGS; UNWEIGHTED GRAPHS; VECTOR SPACES; WEIGHTED GRAPHS;

ALGORITHMS; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; MANGANESE ALLOYS; MANGANESE COMPOUNDS; POLYNOMIAL APPROXIMATION; VECTORS;

APPROXIMATION ALGORITHMS;

EID: 55149100865     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9064-z     Document Type: Article

References (25)

1. A.C. Cassell J.C. Henderson K. Ramachandran 1976 Cycle bases of minimal measure for the structural analysis of skeletal structures by the flexibility method Proc. R. Soc. Lond. Ser. A 350 61 70
2. L.O. Chua L. Chen 1973 On optimally sparse cycle and coboundary basis for a linear graph IEEE Trans. Circuit Theory 20 495 503
3. E. Cohen U. Zwick 2001 All-pairs small-stretch paths J. Algorithms 38 335 353
4. D. Coppersmith S. Winograd 1990 Matrix multiplications via arithmetic progressions J. Symb. Comput. 9 251 280
5. de Pina, J.C.: Applications of shortest path methods. PhD thesis, University of Amsterdam, Netherlands (1995)
6. N. Deo G.M. Prabhu M.S. Krishnamoorthy 1982 Algorithms for generating fundamental cycles in a graph ACM Trans. Math. Softw. 8 26 42
7. Z. Galil O. Margalit 1997 All pairs shortest paths for graphs with small integer length edges J. Comput. Syst. Sci. 54 243 254
8. Golynski, A., Horton, J.D.: A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In: 8th Scandinavian Workshop on Algorithm Theory (2002)
9. D. Hartvigsen 1993 Minimum path bases J. Algorithms 15 1 125 142
10. D. Hartvigsen R. Mardon 1993 When do short cycles generate the cycle space? J. Comb. Theory Ser. B 57 88 99
11. D. Hartvigsen R. Mardon 1994 The all-pairs min cut problem and the minimum cycle basis problem on planar graphs J. Discret. Math. 7 3 403 418
12. J.D. Horton 1987 A polynomial-time algorithm to find a shortest cycle basis of a graph SIAM J. Comput. 16 359 366
13. Hubicka, E., Syslo, M.M.: Minimal bases of cycles of a graph. Recent Adv. Graph. Theory, 283-293 (1975)
14. Kavitha, T., Mehlhorn, K., Michail, D.: New approximation algorithms for minimum cycle bases of graphs. In: Proceedings of 24th International Symposium on Theoretical Aspects of Computer Science (STACS) (2007)
15. E. Kolasinska 1980 On a minimum cycle basis of a graph Zastos. Mat. 16 631 639
16. Mehlhorn, K., Michail, D.: Implementing minimum cycle basis algorithms. In: Proceedings of 4th International Workshop on Experimental and Efficient Algorithms. Lecture Notes in Computer Science, vol. 3503, pp. 32-43. Springer, New York (2005)
17. M.W. Padberg M.R. Rao 1982 Odd minimum cut-sets and b-matchings Math. Oper. Res. 7 67 80
18. Pettie, S., Ramachandran, V.: Computing shortest paths with comparisons and additions. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 267-276 (2002)
19. R. Seidel 1995 On the all-pairs-shortest-path problem in unweighted undirected graphs J. Comput. Syst. Sci. 51 400 403
20. G.F. Stepanec 1964 Basis systems of vector cycles with extremal properties in graphs Uspekhi Mat. Nauk. 19 171 175
21. G. Tewari C. Gotsman S.J. Gortler 2006 Meshing genus-1 point clouds using discrete one-forms Comput. Graph. 30 6 917 926
22. M. Thorup 1999 Undirected single-source shortest paths with positive integer weights in linear time J. ACM 46 362 394
23. M. Thorup 2000 Floats, integers, and single source shortest paths J. Algorithms 35 189 201
24. Zwick, U.: All pairs shortest paths in weighted directed graphs-exact and approximate algorithms. In: Proceedings of the 39th Annual IEEE FOCS, pp. 310-319 (1998)
25. Zykov, A.A.: Theory of Finite Graphs. Nauka, Novosibirsk (1969)