Algorithms to Compute Minimum Cycle Basis in Directed Graphs

Kavitha, Telikepalli and Mehlhorn, Kurt (2007) Algorithms to Compute Minimum Cycle Basis in Directed Graphs. In: Theory of Computing Systems, 40 (4). pp. 485-505.

PDF fulltextspringer1.pdf Restricted to Registered users only Download (352kB) | Request a copy

Abstract

We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. In this problem a {-1,0,1} incidence vector is associated with each cycle and the vector space over ${\Bbb Q}$ generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. This paper presents an $\tilde{O}(m^4n)$ algorithm, which is the first polynomial-time algorithm for computing a minimum cycle basis in G. We then improve it to an $\tilde{O}(m^4)$ algorithm. The problem of computing a minimum cycle basis in an undirected graph has been well studied. In this problem a {0,1} incidence vector is associated with each cycle and the vector space over ${\Bbb GF}(2)$ generated by these vectors is the cycle space of the graph. There are directed graphs in which the minimum cycle basis has lower weight than any cycle basis of the underlying undirected graph. Hence algorithms for computing a minimum cycle basis in an undirected graph cannot be used as black boxes to solve the problem in directed graphs.

Item Type:	Journal Article
Publication:	Theory of Computing Systems
Publisher:	Springer
Additional Information:	Copyright of this article belongs to Springer.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	29 May 2008
Last Modified:	19 Sep 2010 04:45
URI:	http://eprints.iisc.ac.in/id/eprint/14095

Actions (login required)

View Item