✦ LIBER ✦

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 226 || A very fast, practical algorithm for finding a negative cycle in a digraph

✍ Scribed by Kott, Laurent

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto

✍ Díaz, Josep; Karhumäki, Juhani; Lepistö, Arto; Sannella, Donald 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 169 KB

[Lecture Notes in Computer Science] Auto

✍ Lepistö, Timo; Salomaa, Arto 📂 Article 📅 1988 🏛 Springer Berlin Heidelberg ⚖ 823 KB

[Lecture Notes in Computer Science] Auto

✍ Ottmann, Thomas 📂 Article 📅 1987 🏛 Springer Berlin Heidelberg ⚖ 956 KB

[Lecture Notes in Computer Science] Auto

✍ Díaz, Josep; Karhumäki, Juhani; Lepistö, Arto; Sannella, Donald 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 235 KB

[Lecture Notes in Computer Science] Auto

✍ Even, Shimon; Kariv, Oded 📂 Article 📅 1981 🏛 Springer Berlin Heidelberg ⚖ 690 KB

[Lecture Notes in Computer Science] Auto

✍ Baeten, Jos C. M.; Lenstra, Jan Karel; Parrow, Joachim; Woeginger, Gerhard J. 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg ⚖ 391 KB