✦ LIBER ✦

Shortest noncrossing paths in plane graphs

✍ Scribed by Junya Takahashi, Hitoshi Suzuki and Takao Nishizeki

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest Noncrossing Paths in Plane Grap

✍ Takahashi, Hitoshi Suzuki, Takao Ni, Jun-ya 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 463 KB

Shortest paths in euclidean graphs

✍ Robert Sedgewick; Jeffrey Scott Vitter 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 971 KB

Disjoint shortest paths in graphs

✍ Hikoe Enomoto; Akira Saito 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 250 KB

Shortest Paths in Reachability Graphs

✍ J. Desel; J. Esparza 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Shortest paths in Sierpiński graphs

✍ Xue, Bing; Zuo, Liancui; Wang, Guanghui; Li, Guojun 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Approximate shortest paths in weighted g

✍ Raphael Yuster 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 149 KB