Abstract
We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have non-negative weights. A cycle in this graph is actually a cycle in the underlying undirected graph with edges traversable in both directions. A {–1,0,1} edge incidence vector is associated with each cycle: edges traversed by the cycle in the right direction get 1 and edges traversed in the opposite direction get -1. The vector space over ℚ generated by these vectors is the cycle space of G. A minimum cycle basis is a set of cycles of minimum weight that span the cycle space of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m edges and n vertices runs in \(\tilde{O}(m^{\omega+1}n)\) time (where ω< 2.376 is the exponent of matrix multiplication). Here we present an O(m 3 n + m 2 n 2logn) algorithm. We also slightly improve the running time of the current fastest randomized algorithm from O(m 2 nlogn) to O(m 2 n + mn 2 logn).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostol, T.M.: Introduction to Analytic Number Theory. Springer, Heidelberg (1997)
Berger, F., Gritzmann, P., de Vries, S.: Minimum Cycle Bases for Network Graphs. Algorithmica 40(1), 51–62 (2004)
Bollobás, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol. 184. Springer, Berlin (1998)
Cassell, A.C., Henderson, J.C., Ramachandran, K.: 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)
de Pina, J.C.: Applications of Shortest Path Methods. PhD thesis, University of Amsterdam, Netherlands (1995)
Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Englewood Cliffs (1982)
Gleiss, P.M.: Short cycles: minimum cycle bases of graphs from chemistry and biochemistry. PhD thesis, Universität Wien (2001)
Gleiss, P.M., Leydold, J., Stadler, P.F.: Circuit bases of strongly connected digraphs. Discussiones Math. Graph Th. 23, 241–260 (2003)
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)
Horton, J.D.: A polynomial-time algorithm to find a shortest cycle basis of a graph. SIAM Journal of Computing 16, 359–366 (1987)
Kavitha, T.: An Õ(m 2 n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 273–284. Springer, Heidelberg (2005)
Kavitha, T., Mehlhorn, K.: Algorithms to compute Minimum Cycle Bases in Directed Graphs. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 654–665. Springer, Heidelberg (2005)
Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: A faster algorithm for Minimum Cycle Bases of graphs. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 846–857. Springer, Heidelberg (2004)
Liebchen, C.: Finding Short Integral Cycle Bases for Cyclic Timetabling. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 715–726. Springer, Heidelberg (2003)
Liebchen, C., Peeters, L.: On Cyclic Timetabling and Cycles in Graphs. Technical Report 761/, TU Berlin (2002)
Liebchen, C., Rizzi, R.: A Greedy Approach to compute a Minimum Cycle Basis of a Directed Graph. Information Processing Letters 94(3), 107–112 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hariharan, R., Kavitha, T., Mehlhorn, K. (2006). A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_23
Download citation
DOI: https://doi.org/10.1007/11786986_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)