External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Gábor Rétvári

This author has not been identified. Look up 'Gábor Rétvári' in Google

Róbert Szabó

This author has not been identified. Look up 'Róbert Szabó' in Google

József Bíró

This author has not been identified. Look up 'József Bíró' in Google
runs on