✦ LIBER ✦

Recognizing shortest-path trees in linear time

✍ Scribed by C.H. Peng; J.S. Wang; R.C.T. Lee

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognizing breadth-first search trees i

✍ Udi Manber 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 511 KB

A Practical Shortest Path Algorithm with

✍ Goldberg, Andrew V. 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 220 KB

Shortest paths in linear time on minor-c

✍ Siamak Tazari; Matthias Müller-Hannemann 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 963 KB

Simpler Computation of Single-Source Sho

✍ Torben Hagerup 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 163 KB

Spanning trees and shortest paths in mon

✍ T. Dudás; R. Rudolf 📂 Article 📅 1998 🏛 Springer Vienna 🌐 English ⚖ 545 KB

Undirected single-source shortest paths

✍ Thorup, Mikkel 📂 Article 📅 1999 🏛 Association for Computing Machinery 🌐 English ⚖ 262 KB