Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna Paluch  Home/Search
Context Related
| mpisb.mpg.de/~meh...nimumCycleBasis.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpiinf.mpg.de/~mehlhorn/...node1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The previous best result for this problem was an O(m n) algorithm, where ! is the best exponent of matrix multiplication. It is presently known that ! 2:376. We obtain an n+mn log n) algorithm for this problem. When the edge weights are integers, we have an O(m n) algorithm. For unweighted graphs which are... (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: A faster algorithm for minimum cycle basis of graphs. In: 31st International Colloquium on Automata, Languages and Programming, Finland. (2004) 846--857 http://citeseer.ist.psu.edu/kavitha04faster.html More
@misc{ kavitha04faster,
author = "T. Kavitha and K. Mehlhorn and D. Michail and K. Paluch",
title = "A faster algorithm for minimum cycle basis of graphs",
text = "Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: A faster algorithm
for minimum cycle basis of graphs. In: 31st International Colloquium on
Automata, Languages and Programming, Finland. (2004) 846--857",
year = "2004",
url = "citeseer.ist.psu.edu/kavitha04faster.html" }
Citations (may not include all citations):308 Matrix multiplications via arithmetic progressions (context) - Coppersmith, Winograd - 1990
48 Odd minimum cut-sets and b-matchings (context) - Rao - 1982
32 Undirected single-source shortest paths with positive intege.. - Thorup - 1999
23 the all-pairs-shortest-path problem in unweighted undirected.. (context) - Seidel - 1995
22 All pairs shortest paths in weighted directed graphs - exact.. - Zwick - 1998
17 All-pairs small-stretch paths - Cohen, Zwick - 2001
17 Algorithms for generating fundamental cycles in a graph (context) - Deo, Prabhu et al. - 1982
15 All pairs shortest paths for graphs with small integer lengt.. (context) - Galil, Margalit - 1997
9 On optimally sparse cycle and coboundary basis for a linear .. (context) - Chua, Chen - 1973
8 The all-pairs min cut problem and the minimum cycle basis pr.. (context) - Hartvigsen, Mardon - 1994
7 and single source shortest paths (context) - Thorup, integers - 2000
6 When do short cycles generate the cycle space (context) - Hartvigsen, Mardon - 1993
6 Basis systems of vector cycles with extremal properties in g.. (context) - Stepanec - 1964
5 A polynomial-time algorithm to nd a shortest cycle basis of .. (context) - Horton - 1987
5 Theory of Finite Graphs (context) - Zykov - 1969
[Article contains additional citations not shown here]
Documents on the same site (http://www.mpi-inf.mpg.de/~mehlhorn/Journallist/node1.html): More
Certifying and Repairing Solutions to Large LPs -.. - Dhiflaoui, Funke, .. (Correct)
Implementation of O(nm log n) Weighted Matchings in General.. - Mehlhorn, Schäfer (Correct)
Implementing Minimum Cycle Basis Algorithms - Mehlhorn, Michail (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC