✦ LIBER ✦

An algorithm for enumerating all simple paths in a communication network

✍ Scribed by R.B. Misra

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 235 KB
Volume: 19
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(79)90154-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of all simple paths in a com

Enumeration of all simple paths in a communication network

✍ R.B Misra; Krishna B Misra 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A new simple algorithm for enumerating a

A new simple algorithm for enumerating all minimal paths and cuts of a graph

✍ Yuanlong Shen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 KB

A simple algorithm for enumerating longe

A simple algorithm for enumerating longest distances in the plane

✍ Matthew T. Dickerson; Jason Shugart 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 545 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.

An efficient algorithm for simultaneousl

An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network

✍ M.A. Samad 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 399 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