Electronic Journal Article
@Article
Zeitschriftenartikel in einem e-Journal



Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Mehlhorn, Kurt
Michail, Dimitrios

dblp
dblp



BibTeX cite key*:

MM06

Title

Title*:

Implementing Minimum Cycle Basis Algorithms

Journal

Journal Title*:

ACM Journal of Experimental Algorithmics

Journal's URL:

http://www.acm.org/jea/

Download URL
for the article:

http://delivery.acm.org/10.1145/1220000/1216582/p1-mehlhorn.pdf?key1=1216582&key2=4116073711&coll=ACM&dl=ACM&CFID=15151515&CFTOKEN=6184618

Language:

English

Publisher

Publisher's
Name:

ACM

Publisher's URL:


Publisher's
Address:

New York, USA

ISSN:


Vol, No, Year, pp.

Volume:

11

Number:


Month:


Year*:

2006

Pages:

1-14

Number of VG Pages:


Sequence Number:

2.5

DOI:

10.1145/1187436.1216582

Abstract, Links, (C)

Note:


(LaTeX) Abstract:

In this paper, we consider the problem of computing a minimum cycle basis of an undirected graph G = (V,E) with n vertices and m edges. We describe an efficient implementation of an O(m3 + mn2 log n) algorithm. For sparse graphs, this is the currently best-known algorithm. This algorithm's running time can be partitioned into two parts with time O(m3) and O(m2n + mn2 log n), respectively. Our experimental findings imply that for random graphs the true bottleneck of a sophisticated implementation is the O(m2 n + mn2 log n) part. A straightforward implementation would require Ω(nm) shortest-path computations. Thus, we develop several heuristics in order to get a practical algorithm. Our experiments show that in random graphs our techniques result in a significant speed-up. Based on our experimental observations, we combine the two fundamentally different approaches to compute a minimum cycle basis to obtain a new hybrid algorithm with running time O(m2n2). The hybrid algorithm is very efficient, in practice, for random dense unweighted graphs. Finally, we compare these two algorithms with a number of previous implementations for finding a minimum cycle basis of an undirected graph.

URL for the Abstract:

http://doi.acm.org/10.1145/1187436.1216582

Categories / Keywords:


HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Intranet

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@MISC{MM06,
AUTHOR = {Mehlhorn, Kurt and Michail, Dimitrios},
TITLE = {Implementing Minimum Cycle Basis Algorithms},
JOURNAL = {ACM Journal of Experimental Algorithmics},
PUBLISHER = {ACM},
YEAR = {2006},
VOLUME = {11},
PAGES = {1--14},
ADDRESS = {New York, USA},
DOI = {10.1145/1187436.1216582},
}


Entry last modified by Anja Becker, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Dimitrios Michail
Created
02/26/2007 12:17:24 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Anja Becker
Uwe Brahm
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
05.02.2008 15:07:31
2007-04-27 13:19:49
12.03.2007 14:29:58
12.03.2007 14:27:29
02/26/2007 12:17:24 PM