✦ LIBER ✦

Algorithms to Compute Minimum Cycle Basis in Directed Graphs

✍ Scribed by Telikepalli Kavitha; Kurt Mehlhorn

Book ID: 105914874
Publisher: Springer
Year: 2007
Tongue: English
Weight: 344 KB
Volume: 40
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-006-1319-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faster Algorithms for Minimum Cycle Basi

Faster Algorithms for Minimum Cycle Basis in Directed Graphs

✍ Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 249 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

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

Cyclic games and an algorithm to find mi

Cyclic games and an algorithm to find minimax cycle means in directed graphs

✍ V.A. Gurvich; A.V. Karzanov; L.G. Khachivan 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 796 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

An Efficient Parallel Algorithm for Find

An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

✍ M. Furer; B. Raghavachari 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 763 KB