Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
The compactness of interval routing
Cyril Gavoille, David Peleg
Université Bordeaux-I
Weizmann Institute of Science
Research output
:
Contribution to journal
›
Article
›
peer-review
21
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The compactness of interval routing'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Asymptotically-tight
33%
Complexity Measures
33%
Disjoint Set
33%
Foundations of Computer Science
33%
Graph Measures
33%
International Symposium
33%
Interval number
33%
Lecture Notes
33%
Mathematical Foundations
33%
Minimum number
33%
Node Graph
100%
Routing Table
33%
Shortest Path
66%
Shortest Path Routing
33%
Tight Bounds
33%
Computer Science
Complexity Measure
100%
Computer Science
100%
Shortest Path Routing
100%
Space Complexity
100%
Mathematics
Complexity Space
50%
Edge
50%
Outgoing Edge
100%
Pairwise Disjoint Set
50%
Routing Table
50%
Engineering
Disjoint Set
33%
Graph Node
100%
Nodes
66%
Routing Table
33%