✦ LIBER ✦

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1998 Volume 1450 || A parallelization of Dijkstra's shortest path algorithm

✍ Scribed by Brim, Luboš; Gruska, Jozef; Zlatuška, Jiří

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Math

✍ Brim, Luboš; Gruska, Jozef; Zlatuška, Jiří 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 462 KB

[Lecture Notes in Computer Science] Math

✍ Brim, Luboš; Gruska, Jozef; Zlatuška, Jiří 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 524 KB

[Lecture Notes in Computer Science] Math

✍ Blikle, A. 📂 Article 📅 1975 🏛 Springer Berlin Heidelberg ⚖ 377 KB

[Lecture Notes in Computer Science] Math

✍ Kreczmar, Antoni; Mirkowska, Grazyna 📂 Article 📅 1989 🏛 Springer Berlin Heidelberg ⚖ 482 KB

[Lecture Notes in Computer Science] Math

✍ Winkowski, J. 📂 Article 📅 1978 🏛 Springer Berlin Heidelberg ⚖ 589 KB

[Lecture Notes in Computer Science] Math

✍ Wiedermann, Jiří; Hájek, Petr 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 756 KB