Searching among intervals and compact routing tables
Author:
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 28-39
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Planar graph decomposition and all pairs shortest pathsJournal of the ACM, 1991
- Computing shortest paths and distances in planar graphs1991
- Using cellular graph embeddings in solving all pairs shortest paths problems1989
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- Implicit data structures for weighted elementsInformation and Control, 1985
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984
- Implicit Data Structures for the Dictionary ProblemJournal of the ACM, 1983
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959