Collective additive tree spanners for circle graphs and polygonal graphs

A graph G=(V,E) is said to admit a system of @m collective additive tree r-spanners if there is a system T(G) of at most @m spanning trees of G such that for any two vertices u,v of G a spanning tree [email protected]?T(G) exists such that the distance in T between u and v is at most r plus their distance in G. In this paper, we examine the problem of finding ''small'' systems of collective additive tree r-spanners for small values of r on circle graphs and on polygonal graphs. Among other results, we show that every n-vertex circle graph admits a system of at most 2log"3"2n collective additive tree 2-spanners and every n-vertex k-polygonal graph admits a system of at most 2log"3"2k+7 collective additive tree 2-spanners. Moreover, we show that every n-vertex k-polygonal graph admits an additive (k+6)-spanner with at most 6n-6 edges and every n-vertex 3-polygonal graph admits a system of at most three collective additive tree 2-spanners and an additive tree 6-spanner. All our collective tree spanners as well as all sparse spanners are constructible in polynomial time.

[1]  Ehab S. Elmallah,et al.  Polygon Graph Recognition , 1998, J. Algorithms.

[2]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[3]  Alain Guénoche,et al.  Trees and proximity representations , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[4]  Jeremy P. Spinrad,et al.  Recognition of Circle Graphs , 1994, J. Algorithms.

[5]  Arthur L. Liestman,et al.  Additive graph spanners , 1993, Networks.

[6]  Feodor F. Dragan,et al.  Collective Tree 1-Spanners for Interval Graphs , 2005, WG.

[7]  D. Peleg.  Proximity-preserving labeling schemes , 2000, J. Graph Theory.

[8]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

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

[10]  P. Sneath,et al.  Numerical Taxonomy , 1962, Nature.

[11]  Erich Prisner.  Distance Approximating Spanning Trees , 1997, STACS.

[12]  Sudipto Guha,et al.  Approximating a finite metric by a small number of tree metrics , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[13]  Leizhen Cai,et al.  Tree Spanners , 1995, SIAM J. Discret. Math..

[14]  Alejandro A. Schäffer,et al.  Graph spanners , 1989, J. Graph Theory.

[15]  Yang Xiang,et al.  Additive Spanners for Circle Graphs and Polygonal Graphs , 2008, WG.

[16]  David Peleg,et al.  An optimal synchronizer for the hypercube , 1987, PODC '87.

[17]  Paul Chew,et al.  There are Planar Graphs Almost as Good as the Complete Graph , 1989, J. Comput. Syst. Sci..

[18]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[19]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

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

[21]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[22]  Feodor F. Dragan,et al.  Additive sparse spanners for graphs with bounded length of largest induced cycle , 2005, Theor. Comput. Sci..

[23]  D. Wagner,et al.  Additive Tree Spanners , 2004 .

[24]  Feodor F. Dragan,et al.  Collective Tree Spanners and Routing in AT-free Related Graphs , 2004, WG.

[25]  Arnold L. Rosenberg,et al.  Optimal simulations of tree machines , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[26]  Ming-Yang Kao,et al.  Phylogeny Reconstruction , 2008, Encyclopedia of Algorithms.

[27]  David Peleg,et al.  Proximity-Preserving Labeling Schemes and Their Applications , 1999, WG.

[28]  Feodor F. Dragan,et al.  Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width , 2005, ISAAC.

[29]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .