A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Efficient message routing in planar networks
SIAM Journal on Computing
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
Improved routing strategies with succinct tables
Journal of Algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Journal of Algorithms
Distance approximating trees for chordal and dually chordal graphs
Journal of Algorithms
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Routing in distributed networks: overview and open problems
ACM SIGACT News
Informative Labeling Schemes for Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Short and Simple Labels for Small Distances and Other Functions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Compact Routing Tables for Graphs of Bounded Genus
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Distance Approximating Spanning Trees
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
On compact and efficient routing in certain graph classes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
| Hi-index | 0.00 |
This paper concerns routing with succinct tables in chordal graphs. We show how to construct in polynomial time, for every n-node chordal graph, a routing scheme using routing tables and addresses of O(log3 n/ log log n) bits per node, and O(log2 n/ log log n) bit not alterable headers such that the length of the route between any two nodes is at most the distance between the nodes in the graph plus two.