✦ LIBER ✦

A local algorithm for finding the bicomponents in a flow graph

✍ Scribed by V.A. Evstigneev

Publisher: Elsevier Science
Year: 1978
Weight: 368 KB
Volume: 18
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(78)90128-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Efficient systolic algorithm for finding

Efficient systolic algorithm for finding bridges in a connected graph

✍ M Zubair; B.B Madan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 472 KB

An algorithm for finding a short closed

An algorithm for finding a short closed spanning walk in a graph

✍ K. Takamizawa; T. Nishizeki; N. Saito 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 653 KB

An algorithm for finding the minimum ske

An algorithm for finding the minimum skeleton of a growing graph

✍ G.B. Roshchin 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 325 KB

A Parallel Algorithm for Finding Minimum

A Parallel Algorithm for Finding Minimum Cutsets in Reducible Graphs

✍ E. Dekel; J. Hu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 940 KB

A new algorithm for finding a pseudoperi

A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph

✍ Paulino, Glaucio H. ;Menezes, Ivan F. M. ;Gattass, Marcelo ;Mukherjee, Subrata 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 867 KB