✦ LIBER ✦

An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

✍ Scribed by Moyles, Dennis M.; Thompson, Gerald L.

Book ID: 120631317
Publisher: Association for Computing Machinery
Year: 1969
Tongue: English
Weight: 357 KB
Volume: 16
Category: Article
ISSN: 0004-5411
DOI: 10.1145/321526.321534

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a minimum equivalent graph of a

Finding a minimum equivalent graph of a digraph

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 537 KB

An Algorithm for Finding a Minimal Equiv

An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

✍ Hsu, Harry T. 📂 Article 📅 1975 🏛 Association for Computing Machinery 🌐 English ⚖ 320 KB

An algorithm for finding a minimal equiv

An algorithm for finding a minimal equivalent graph of a strongly connected digraph

✍ S. Martello 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 505 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 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

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