✦ LIBER ✦

Faster Algorithms for Minimum Cycle Basis in Directed Graphs

✍ Scribed by Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt

Book ID: 118180779
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 249 KB
Volume: 38
Category: Article
ISSN: 0097-5397
DOI: 10.1137/060670730

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms to Compute Minimum Cycle Basi

Algorithms to Compute Minimum Cycle Basis in Directed Graphs

✍ Telikepalli Kavitha; Kurt Mehlhorn 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 344 KB

A Faster Algorithm for Finding the Minim

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

✍ J.X. Hao; J.B. Orlin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum

New Approximation Algorithms for Minimum

New Approximation Algorithms for Minimum Cycle Bases of Graphs

✍ Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 517 KB

Efficient algorithms for finding minimum

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

✍ Harold N. Gabow; Zvi Galil; Thomas Spencer; Robert E. Tarjan 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 939 KB

Edge-swapping algorithms for the minimum

Edge-swapping algorithms for the minimum fundamental cycle basis problem

✍ Edoardo Amaldi; Leo Liberti; Francesco Maffioli; Nelson Maculan 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 767 KB

An optimal algorithm for cycle breaking

An optimal algorithm for cycle breaking in directed graphs

✍ Tatiana Orenstein; Zvi Kohavi; Irith Pomeranz 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 831 KB