✦ LIBER ✦

An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks

✍ Scribed by Rachid Hadid; Mehmet Hakan Karaata

Book ID: 108100813
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 938 KB
Volume: 32
Category: Article
ISSN: 0140-3664
DOI: 10.1016/j.comcom.2008.12.035

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding Edge-disjoint Paths in Networks:

Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm

✍ Maria J. Blesa; Christian Blum 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 935 KB

A localized algorithm for finding disjoi

A localized algorithm for finding disjoint paths in wireless sensor networks

✍ Ronghui Hou; Haoshan Shi 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 77 KB

An Inherently Stabilizing Algorithm for

An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks

✍ Sinanoglu, O.; Karaata, M.H.; AlBdaiwi, B. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 400 KB

An algorithm for finding reasonable path

An algorithm for finding reasonable paths in transit networks

✍ Man-chun Tan; C. O. Tong; S. C. Wong; Jian-min Xu 📂 Article 📅 2007 🏛 Institute for Transportation Inc. 🌐 English ⚖ 299 KB

Algorithms for finding an optimal set of

Algorithms for finding an optimal set of short disjoint paths in a communication network

✍ Torrieri, D. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 461 KB

An Algorithm for finding optimum path in

An Algorithm for finding optimum path in networks

✍ Kabekode V.S. Bhat 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 242 KB

In this paper we present an O((V( . loglV() algorithm forfinding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.