On compact and efficient routing in certain graph classes

Authors:
Feodor F. Dragan;Irina Lomonosov
Affiliations:
Department of Computer Science, Kent State University, Kent, OH, USA;Department of Computer Science, Hiram College, Hiram, OH, USA
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 19
Cited 1

Interval routing

The Computer Journal
A tradeoff between space and efficiency for routing tables

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Memory requirement for universal routing schemes

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
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

Graph classes: a survey
The ultimate interval graph recognition algorithm?

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A survey on interval routing

Theoretical Computer Science
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
Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Approximate distance oracles

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
Linear-Time Recognition of Circular-Arc Graphs

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
On compact and efficient routing in certain graph classes

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Sparse spanners vs. compact routing

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.04

Visualization

Abstract

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 @D=