✦ LIBER ✦

On computing sets of shortest paths in a graph

✍ Scribed by Minieka, Edward

Book ID: 127360420
Publisher: Association for Computing Machinery
Year: 1974
Tongue: English
Weight: 261 KB
Volume: 17
Category: Article
ISSN: 0001-0782
DOI: 10.1145/355616.364037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest path computations in source-dep

Shortest path computations in source-deplanarized graphs

✍ Greg N. Frederickson; Susanne E. Hambrusch; Hung-Yi Tu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 485 KB

Optimal computation of shortest paths on

Optimal computation of shortest paths on doubly convex bipartite graphs

✍ L. Chen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 732 KB

Intersection functions of shortest paths

Intersection functions of shortest paths in a nondirected graph

✍ Genya Kishi; Isao Sasakis 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 660 KB

Finding shortest paths on surfaces using

Finding shortest paths on surfaces using level sets propagation

✍ Kimmel, R.; Amir, A.; Bruckstein, A.M. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 551 KB

The number of shortest paths in the arra

The number of shortest paths in the arrangement graph

✍ Cheng, Eddie; Grossman, Jerrold W.; Qiu, Ke; Shen, Zhizhang 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 557 KB

On computing graph minor obstruction set

On computing graph minor obstruction sets

✍ Kevin Cattell; Michael J. Dinneen; Rodney G. Downey; Michael R. Fellows; Michael 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 149 KB

The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural graph properties are characterized by a ÿnite set of forbidden substructures, the obstructions for the property. We prove several general theorems regarding the computation of obstruction sets from other