Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn  Home/Search
Context
Related
| mpisb.mpg.de/~meh...edDirCycleBasis.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: We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have non-negative weights. A cycle in this graph is actually a cycle in the underlying undirected graph with edges traversable in both directions. A f1;0;1g edge incidence vector is associated with each cycle: edges traversed by the cycle in the right direction get 1 and edges traversed in the opposite direction get-1. The vector space over Q generated... (Update)
Active bibliography (related documents): More All
0.8: Implementing Minimum Cycle Basis Algorithms - Mehlhorn, Michail (2005) (Correct)
0.5: Algorithms to Compute Minimum Cycle Basis in Directed Graphs - Kavitha, Mehlhorn (Correct)
0.3: A faster algorithm for Minimum Cycle Basis of graphs - Kavitha, Mehlhorn, Michail, .. (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ hariharan-faster,
author = "Ramesh Hariharan and Telikepalli Kavitha and Kurt Mehlhorn",
title = "A Faster Deterministic Algorithm for Minimum Cycle Basis in Directed Graphs",
url = "citeseer.ist.psu.edu/745046.html" }
Citations (may not include all citations):104 Introduction to Analytic Number Theory (context) - Apostol - 1997
82 Graph Theory with Applications to Engineering and Computer S.. (context) - Deo - 1982
28 A polynomial-time algorithm to find a shortest cycle basis o.. (context) - Horton - 1987
6 volume 184 of Graduate Texts in Mathematics (context) - Bollobas, Theory - 1998
3 Applications of Shortest Path Methods (context) - de Pina - 1995
2 A polynomial time algorithm to find the minimum cycle basis .. (context) - Golynski, Horton - 2002
2 Minimum Cycle Bases for Network Graphs (context) - Berger, Gritzmann et al. - 2004
1 Royal Society of London Series (context) - Cassell, Henderson et al. - 1976
1 Short cycles: minimum cycle bases of graphs from chemistry a.. (context) - Gleiss - 2001
1 Circuit bases of strongly connected digraphs - Gleiss, Leydold et al. - 2003
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