✦ LIBER ✦

An algorithm for the most economic link addition in a tree communications network

✍ Scribed by E.J. Cockayne; F. Ruskey; A.G. Thomason

Book ID: 113162072
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 418 KB
Volume: 9
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(79)90062-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear time algorithms for computing the

Linear time algorithms for computing the most reliable source on an unreliable tree network

✍ Xue, Guoliang 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

Given a tree network with n vertices where each edge has an operational probability, we are interested in finding a vertex on the tree whose expected number of reachable vertices is maximum. This problem was studied in Networks 27 (1996) 219-237, where an O(n 3 ) time algorithm and an O(n 2 ) time a

An algorithm for determining the most re

An algorithm for determining the most reliable path of a network

✍ V.K. Jain; Krishna Gopal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 156 KB

An algorithm for determining the best pa

An algorithm for determining the best path in a computer communication network

✍ V.K. Jain; Krishna Gopal 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 243 KB

An algorithm for enumerating all simple

An algorithm for enumerating all simple paths in a communication network

✍ R.B. Misra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 235 KB

An improved algorithm for the distance c

An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks

✍ Arie Tamir 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

An algorithm for computing the stable co

An algorithm for computing the stable coalition structures in tree-graph communication games

✍ Fritz H. Grafe; Elena Inarra; Ana Mauleon 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 449 KB