Compact Routing Schemes for Generalised Chordal Graphs

In this paper, we show how to use the notion of layering-tree introduced in [5], in order to obtain polynomial time constructible routing schemes. We describe efficient routing schemes for two classes of graphs that include the class of chordal graphs. For k-chordal graphs, i.e., graphs containing no induced cycle of length greater than k, the routing scheme uses addresses and local memories of size O(log 2 n) bits per node, and the length of the route between all pairs of vertices never exceeds their distance plus k + 1 (deviation at most k + 1). For tree-length δ graphs, i.e., graphs admitting a tree-decomposition in which the diameter of any bag is at most δ, the routing scheme uses addresses and local memories of size O(δ log 2 n) bits per node, and its deviation is at most 6δ� 2. Observe that for chordal graphs, for which δ = 1 and k = 3, both schemes produce a deviation 4, with addresses and local memories of size O(log 2 n )b its per node.

[1]  Pierre Fraigniaud,et al.  Routing in Trees , 2001, ICALP.

[2]  Cyril Gavoille,et al.  An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three , 1997, SIROCCO.

[3]  Cyril Gavoille,et al.  Improved Compact Routing Scheme for Chordal Graphs , 2002, DISC.

[4]  Feodor F. Dragan,et al.  Additive Spanners for k-Chordal Graphs , 2003, CIAC.

[5]  Cyril Gavoille,et al.  Approximate Distance Labeling Schemes , 2000, Electron. Notes Discret. Math..

[6]  Fanica Gavril,et al.  Algorithms for maximum weight induced paths , 2002, Inf. Process. Lett..

[7]  Baruch Awerbuch,et al.  Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..

[8]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[9]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[10]  Mikkel Thorup,et al.  Compact routing schemes , 2001, SPAA '01.

[11]  Pierre Fraigniaud,et al.  Universal routing schemes , 1997, Distributed Computing.

[12]  Baruch Awerbuch,et al.  Compact distributed data structures for adaptive routing , 1989, STOC '89.

[13]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[14]  Yon Dourisboure.  Routage compact et longueur arborescente , 2003 .

[15]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[16]  Baruch Awerbuch,et al.  Improved Routing Strategies with Succinct Tables , 1990, J. Algorithms.

[17]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[18]  Stéphane Pérennes,et al.  Memory requirement for routing in distributed networks , 1996, PODC '96.

[19]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[20]  Feodor F. Dragan,et al.  Collective Tree Spanners of Graphs , 2004, SWAT.

[21]  Feodor F. Dragan,et al.  A Note on Distance Approximating Trees in Graphs , 2000, Eur. J. Comb..

[22]  Cyril Gavoille,et al.  Tree-Decomposition of Graphs with small Diameter Bags , 2003 .