The Computer Journal
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Homogeneously orderable graphs
Theoretical Computer Science
Graph classes: a survey
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
Routing in distributed networks: overview and open problems
ACM SIGACT News
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
Distributed relationship schemes for trees
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Short labels by traversal and jumping
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Exact distance labelings yield additive-stretch compact routing schemes
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
In this paper we refine the notion of tree-decomposition by introducing acyclic (R,D)-clustering, where clusters are subsets of vertices of a graph and R and D are the maximum radius and the maximum diameter of these subsets We design a routing scheme for graphs admitting induced acyclic (R,D)-clustering where the induced radius and the induced diameter of each cluster are at most 2 We show that, by constructing a family of special spanning trees, one can achieve a routing scheme of deviation Δ ≤ 2R with labels of size O(log3n / loglog n) bits per vertex and O(1) routing protocol for these graphs We investigate also some special graph classes admitting induced acyclic (R,D)-clustering with induced radius and diameter less than or equal to 2, namely, chordal bipartite, homogeneously orderable, and interval graphs We achieve the deviation Δ = 1 for interval graphs and Δ = 2 for chordal bipartite and homogeneously orderable graphs.