✦ LIBER ✦

An efficient algorithm for building min-path trees for all origins in a multi-class network

✍ Scribed by Robert B. Dial

Book ID: 116937338
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 171 KB
Volume: 40
Category: Article
ISSN: 0191-2615
DOI: 10.1016/j.trb.2005.12.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce

[IEEE 2010 Sixth International Conferenc

[IEEE 2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2010) - Hangzhou (2010.12.20-2010.12.22)] 2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks - An Efficient Scheduling Algorithm for Data Collection through Multi-path Routing Structures in Wireless Sensor Networks

✍ Hai Van Luu, ; Xueyan Tang, 📂 Article 📅 2010 🏛 IEEE ⚖ 338 KB