✦ LIBER ✦

Evaluation of a Path-Finding Algorithm for Interconnected Local Area Networks

✍ Scribed by Wong, J.; Vernon, A.; Field, J.

Book ID: 119795461
Publisher: IEEE
Year: 1987
Tongue: English
Weight: 825 KB
Volume: 5
Category: Article
ISSN: 0733-8716
DOI: 10.1109/jsac.1987.1146661

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Performance comparison of bridge algorit

Performance comparison of bridge algorithms in interconnected local area networks

✍ Do Y. Lee; Jai Y. Lee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 734 KB

A Genetic Algorithm for Finding the Page

A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks

✍ Nidhi Kapoor; Mark Russell; Ivan Stojmenovic; Albert Y. Zomaya 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 151 KB

A ''book-embedding'' of a graph G comprises embedding the graph's nodes along the spine of a book and embedding the edges on the pages so that the edges embedded on the same page do not intersect. This is also referred to as the page model. The ''pagenumber'' of a graph is the thickness of the small

A Lagrangian Relaxation Technique for Op

A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks

✍ Peter C. Fetterolf and G. Anandalingam 📂 Article 📅 1992 🏛 INFORMS 🌐 English ⚖ 404 KB

Derivation of a distributed algorithm fo

Derivation of a distributed algorithm for finding paths in directed networks

✍ Robert McCurley; Fred B. Schneider 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 453 KB

An algorithm for finding the k quickest

An algorithm for finding the k quickest paths in a network

✍ Y.L. Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 652 KB