Small stretch spanners on dynamic graphs

Journal of Graph Algorithms and Applications

Volumn 10, Issue 2, 2006, Pages 365-385

  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

GRAPHIC METHODS;

AMORTIZED TIME; DYNAMIC GRAPH; EDGE COSTS; FULLY DYNAMIC ALGORITHMS; INSERTIONS AND DELETIONS; MAXIMUM DEGREE; ON DYNAMICS; UNDIRECTED GRAPH; UNWEIGHTED GRAPHS; WEIGHTED GRAPH;

UNDIRECTED GRAPHS;

EID: 38049038483     PISSN: None     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00133     Document Type: Article

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, Oct. 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 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of LNCS, pages 384-396, Berlin, 2003. Springer.
5. L. Cai. NP-completeness of minimum spanner problems. Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 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, Oct. 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 H. Djidjev, editor, Proceedings of the International Symposium on Optimal Algorithms, volume 401 of LNCS, pages 168-192, Berlin, May 29-June 2 1989. Springer.
10. D. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete & Computational Geometry, 5:399-407, 1990.
11. See also 28th Symp. Found. Comp. Sci., 1987, pp. 20-26.
12. A. L. Liestman and T. Shermer. Additive graph spanners. Networks: An International Journal, 23:343-364, 1993.
13. A. L. Liestman and T. Shermer. Grid spanners. Networks: An International Journal, 23:122-133, 1993.
14. D. Peleg and A. Shäffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
15. D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. SIAM Journal on Computing, 18(4):740-747, Aug. 1989.
16. D. Richards and A. L. Liestman. Degree-constrained pyramid spanners. JPDC: Journal of Parallel and Distributed Computing, 25:1-6, 1995.
17. L. Roditty, M. Thorup, and U. Zwick. Deterministic constructions of approximate distance oracles and spanners. In Proceedings of the The 32nd International Colloquium on Automata, Languages and Programming: Lisbon, Portugal, July 11-15, 2005, pages 261-272, 2005.
18. L. Roditty and U. Zwick. Dynamic approximate all-pairs shortest paths in undirected graphs. In Proceedings of the 45th IEEE Conference on Foundations of Computer Science: Rome, Italy, October 17-19, 2004, pages 499-508, 2004.
19. L. Roditty and U. Zwick. On dynamic shortest paths problems. In Proceedings of the 12th Annual European Symposium on Algorithms (ESA-04), pages 580-591, 2004.
20. 10,s. Journal of Combinatorial Theory Series B, 52:113-116, 1991.