On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity

Gábor Rétvári, Róbert Szabó, József Bíró. On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. In Nikolas Mitrou, Kimon P. Kontovasilis, George N. Rouskas, Ilias Iliadis, Lazaros F. Merakos, editors, NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings. Volume 3042 of Lecture Notes in Computer Science, pages 1180-1191, Springer, 2004. [doi]

Abstract

Abstract is missing.