External Links

Cite Key

Statistics

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

PDF

Tags

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.

The Complexity of Shortest Path and Dilation Bounded Interval Routing

Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic. The Complexity of Shortest Path and Dilation Bounded Interval Routing. In Christian Lengauer, Martin Griebl, Sergei Gorlatch, editors, Euro-Par 97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings. Volume 1300 of Lecture Notes in Computer Science, pages 258-265, Springer, 1997.

Abstract

Abstract is missing.

runs on