A Symbolic Approach to the All-Pairs Shortest-Paths Problem

Daniel Sawitzki. A Symbolic Approach to the All-Pairs Shortest-Paths Problem. In Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel, editors, Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers. Volume 3353 of Lecture Notes in Computer Science, pages 154-167, Springer, 2004. [doi]

Abstract

Abstract is missing.