Small stretch spanners on dynamic graphs

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 532-543

  Ausiello, Giorgio ^a   Franciosa, Paolo G ^a   Italiano, Giuseppe F ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; OPTIMAL CONTROL SYSTEMS;

SPANNER; UNDIRECTED GRAPHS; WEIGHTED GRAPHS;

GRAPH THEORY;

EID: 27144476982     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_48     Document Type: Conference Paper

References (20)

1. I. Althofer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993.
2. B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804-823, 1985.
3. H.-J. Bandelt and A. Dress. Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math., 7:309-343, 1986.
4. 1+1/k) size for weighted graphs. In Proc. 30th ICALP, 384-396.
5. L. Cai. NP-completeness of minimum spanner problems. Discr. Appl. Math. and Comb. Oper. Research and Comp. Sci., 48(2): 187-194, 1994.
6. L. Cai and J. M. Keil. Degree-bounded spanners. Parallel Processing Letters, 3:457-468, 1993.
7. L. P. Chew. There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences, 39(2):205-219, 1989.
8. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
9. G. Das and D. Joseph. Which triangulations approximate the complete graph? In Proc. Int. Symp. on Optimal Algorithms, 168-192.
10. D. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom., 5:399-407, 1990.
11. A. L. Liestman and T. Shermer. Additive graph spanners. Networks, 23:343-364, 1993.
12. A. L. Liestman and T. Shermer. Grid spanners. Networks, 23:122-133, 1993.
13. D. Peleg and A. Shäffer. Graph spanners. J. of Graph Theory, 13:99-116, 1989.
14. D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. SIAM Journal on Computing, 18(4):740-747, 1989.
15. D. Richards and A. L. Liestman. Degree-constrained pyramid spanners. Journal of Parallel and Distributed Computing, 25:1-6, 1995.
16. L. Roditty and M. Thorup and U. Zwick. Deterministic constructions of approximate distance oracles and spanners. In Proc. ICALP 2005, to appear.
17. L. Roditty and U. Zwick. Dynamic approximate all-pairs shortest paths in undirected graphs. In Proc. FOCS 2004, 499-508.
18. L. Roditty and U. Zwick. On dynamic shortest paths problems. In Proc. ESA 2004, 580-591.
19. 10's. J. Combin. Theory Ser. B, 52:113-116, 1991.
20. U. Zwick. Personal communication.