Abstract
In this paper we consider the problems of computing a minimum co-cycle basis and a minimum weakly fundamental co-cycle basis of a directed graph G. A co-cycle in G corresponds to a vertex partition (S,V ∖ S) and a { − 1,0,1} edge incidence vector is associated with each co-cycle. The vector space over ℚ generated by these vectors is the co-cycle space of G. Alternately, the co-cycle space is the orthogonal complement of the cycle space of G. The minimum co-cycle basis problem asks for a set of co-cycles that span the co-cycle space of G and whose sum of weights is minimum. Weakly fundamental co-cycle bases are a special class of co-cycle bases, these form a natural superclass of strictly fundamental co-cycle bases and it is known that computing a minimum weight strictly fundamental co-cycle basis is NP-hard. We show that the co-cycle basis corresponding to the cuts of a Gomory-Hu tree of the underlying undirected graph of G is a minimum co-cycle basis of G and it is also weakly fundamental.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berger, F., Gritzmann, P., de Vries, S.: Minimum Cycle Bases for Network Graphs. Algorithmica 40(1), 51–62 (2004)
Bunke, F., Hamacher, H.W., Maffioli, F., Schwahn, A.M.: Minimum cut bases in undirected networks Report in Wirtschaftsmathematik 56, Fachbereich Mathematik, TU Kaiserslautern (2007)
de Pina, J.C.: Applications of Shortest Path Methods. PhD thesis, University of Amsterdam, Netherlands (1995)
Elkin, M., Liebchen, C., Rizzi, R.: New length bounds for cycle bases. Information Processing Letters, 104(5): 186-193 (2007)
Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. Journal of the ACM, 45(5): 783-797 (1998)
Golynski, A., Horton, J.D.: A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 200–209. Springer, Heidelberg (2002)
Gomory, R., Hu, T.C.: Multi-terminal network flows. SIAM Journal on Computing 9, 551–570 (1961)
Gusfield, D.: Very simple methods for all pairs network flow analysis. SIAM Journal on Computing 19(1), 143–155 (1990)
Hariharan, R., Kavitha, T., Mehlhorn, K.: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 273–284. Springer, Heidelberg (2006)
Horton, J.D.: A polynomial-time algorithm to find a shortest cycle basis of a graph. SIAM Journal on Computing 16, 359–366 (1987)
Kavitha, T.: An \(\tilde{O}(m^2n)\) 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. Theory of Computing Systems 40, 485–505 (2007)
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)
Leydold, J., Stadler, P.F.: Minimum cycle bases of outerplanar graphs. Electronic Journal of Combinatorics 5 (1998)
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/2002, 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)
Liebchen, C., Rizzi, R.: Classes of Cycle Bases. Discrete Applied Mathematics 155(3), 337–355 (2007)
Rizzi, R.: Minimum Weakly Fundamental Cycle Bases are hard to find. Algorithmica (published online October 2007)
Schrijver, A.: Theory of Linear and Integer Programming, 2nd edn. Wiley, Chichester (1998)
Whitney, H.: On the abstract properties of linear dependence. American Journal of Mathematics 57, 509–533 (1935)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kavitha, T. (2008). On a Special Co-cycle Basis of Graphs. In: Gudmundsson, J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69903-3_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-69903-3_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69900-2
Online ISBN: 978-3-540-69903-3
eBook Packages: Computer ScienceComputer Science (R0)