A greedy approach to compute a minimum cycle basis of a directed graph

  • Authors:

  • Christian Liebchen;Romeo Rizzi

  • Affiliations:

  • Technische Universität Berlin, Institut für Mathematik, Combinatorial Optimization and Graph Algorithms, Straße des 17. Juni 136, D-10623 Berlin, Germany;Università degli Studi di Trento, Facoltá di Scienze, Dipartimento di Informatica e Telecomunicazioni, Via Sommarive, 14, I-38050 Povo (Trento), Italy

  • Venue:
  • Information Processing Letters
  • Year:
  • 2005

Quantified Score

Hi-index 0.89

Visualization

Abstract

We consider the problem of computing a minimum cycle basis of a directed graph with m arcs and n nodes. We adapt the greedy approach proposed by Horton [A polynomial-time algorithm to find the shortest cycle basis of a graph, SIAM J. Comput. 16 (1987) 358] and hereby obtain a very simple exact algorithm of complexity O@?(m^4n), being as fast as the first algorithm proposed for this problem [A polynomial time algorithm for minimum cycle basis in directed graphs, Kurt Mehlhorn's List of Publications, 185, MPI, Saarbrucken, 2004, http://www.mpi-sb.mpg.de/~mehlhorn/ftp/DirCycleBasis.ps; Proc. STACS 2005, submitted for publication]. Moreover, the speed-up of Golynski and Horton [A polynomial time algorithm to find the minimum cycle basis of a regular matroid, in: M. Penttonen, E. Meineche Schmidt (Eds.), SWAT 2002, Lecture Notes in Comput. Sci., vol. 2368, Springer, Berlin, 2002, pp. 200-209] applies to this problem, providing an exact algorithm of complexity O@?(m^@w^+^1n), in particular O@?(m^3^.^3^7^6n). Finally, we prove that these greedy approaches fail for more specialized subclasses of directed cycle bases.