A faster deterministic algorithm for minimum cycle bases in directed graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 250-261

  Hariharan, Ramesh ^a   Kavitha, Telikepalli ^a   Mehlhorn, Kurt ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; MATRIX ALGEBRA; VECTORS;

CYCLE; DIRECTED GRAPH; EDGES; RANDOMIZED ALGORITHM;

GRAPH THEORY;

EID: 33746374440     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_23     Document Type: Conference Paper

References (16)

1. T. M. Apostol. Introduction to Analytic Number Theory. Springer-Verlag, 1997.
2. F. Berger, P. Gritzmann, and S. de Vries. Minimum Cycle Bases for Network Graphs. Algorithmica, 40(1): 51-62, 2004.
3. B. Bollobás. Modern Graph Theory, volume 184 of Graduate Texts in Mathematics, Springer, Berlin, 1998.
4. A. C. Cassell, J. C. Henderson and K. Ramachandran. Cycle bases of minimal measure for the structural analysis of skeletal structures by the flexibility method Proc. Royal Society of London Series A, 350: 61-70, 1976.
5. J.C. de Pina. Applications of Shortest Path Methods. PhD thesis, University of Amsterdam, Netherlands, 1995.
6. N. Deo. Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Englewood Cliffs, 1982.
7. P. M. Gleiss. Short cycles: minimum cycle bases of graphs from chemistry and biochemistry. PhD thesis, Universität Wien, 2001.
8. P. M. Gleiss, J. Leydold, and P. F. Stadler. Circuit bases of strongly connected digraphs. Discussiones Math. Graph Th., 23: 241-260, 2003.
9. Alexander Golynski arid Joseph D. Hort on. A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In 8th Scandinavian Workshop on Algorithm Theory, 2002.
10. J. D. Horton. A polynomial-time algorithm to find a shortest cycle basis of a graph. SIAM Journal of Computing, 16:359-366, 1987.
11. T. Kavitha. An Õ(m2n) Randomized Algorithm to compute a Minimum Cycle Basis of a Directed Graph. In Proc. of ICALP, LNCS 3580: 273-284, 2005.
12. T. Kavitha and K. Mehlhorn. Algorithms to compute Minimum Cycle Bases in Directed Graphs. Full version to appear in special issue of TOCS, preliminary version in Proc. of STACS, LNCS 3404: 654-665, 2005.
13. T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch. A faster algorithm for Minimum Cycle Bases of graphs. In Proc. of ICALP, LNCS 3142: 846-857, 2004.
14. Christian Liebchen. Finding Short Integral Cycle Bases for Cyclic Timetabling. In Proc. of ESA, LNCS 2832: 715-726, 2003.
15. C. Liebchen and L. Peeters. On Cyclic Timetabling and Cycles in Graphs. Technical Report 761/2002, TU Berlin.
16. C. Liebchen and R. Rizzi. A Greedy Approach to compute a Minimum Cycle Basis of a Directed Graph. Information Processing Letters, 94(3): 107-112, 2005.