✦ LIBER ✦

An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

✍ Scribed by Hsu, Harry T.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for finding a minimal equiv

✍ S. Martello 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 505 KB

Finding a minimum equivalent graph of a

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

Efficient algorithm for finding all mini

✍ A. V. Karzanov; E. A. Timofeev 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 524 KB

Algorithmus 26 An algorithm for finding

✍ J. Dzikiewicz 📂 Article 📅 1975 🏛 Springer Vienna 🌐 English ⚖ 194 KB

An algorithm finding p-medians of a grap

✍ S. A. Gorunovich 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 455 KB

An algorithm for evaluating all the mini

✍ Brijendra Singh 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 190 KB