✦ LIBER ✦

Finding a minimum equivalent graph of a digraph

✍ Scribed by Silvano Martello; Paolo Toth

Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 537 KB
Volume: 12
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230120202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a minimum independent dominating

Finding a minimum independent dominating set in a permutation graph

✍ Mikhail J. Atallah; Glenn K. Manacher; J. Urrutia 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 862 KB

On finding a minimum vertex cover of a s

On finding a minimum vertex cover of a series-parallel graph

✍ Ioannis G. Tollis 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Finding all minimum-size separating vert

Finding all minimum-size separating vertex sets in a graph

✍ Arkady Kanevsky 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 812 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

The competition-common enemy graph of a

The competition-common enemy graph of a digraph

✍ Debra D. Scott 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 535 KB