The Computer Journal
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Efficient message routing in planar networks
SIAM Journal on Computing
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Journal of Algorithms
Graph classes: a survey
Distance approximating trees for chordal and dually chordal graphs
Journal of Algorithms
Theoretical Computer Science
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
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
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
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
| 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 of maximum clique size k, a routing scheme using routing tables of O(k log n) bits per node and O(log n) bit addresses such that the length of the route between any two nodes is at most the distance between the nodes in the graph plus two. This is complemented by a recent lower bound that shows that if the shortest paths and O(log n) bit addresses are required, every routing strategy for this class needs 驴(2k log(n/2k)) bits per node.