Dynamic graph algorithms with applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1851, Issue , 2000, Pages 1-9

  Thorup, Mikkel ^a   Karger, David R ^b  

^a AT AND T LABS RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC ROUTING ALGORITHMS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

DYNAMIC GRAPH ALGORITHMS; DYNAMIC SHORTEST PATH; EDGE CONNECTIVITY; LOCAL SEARCH ALGORITHM; MATCHINGS IN GRAPHS; MINIMUM SPANNING TREES; OUTPUT-SENSITIVE ALGORITHM; PACKING SPANNING TREES;

ALGORITHMS;

EID: 84956863486     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (25)

1. E. H. L. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. Discrete Mathematics and Optimization. Wiley-Interscience, Chichester, England, June 1997.
2. A.V. Aho, Y. Sagiv, T.G. Szymanski, and J.D. Ullman. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Computing, 10(3):405-421, 1981.
3. T.C. Biedl, P. Bose, E.D. Demaine, and A. Lubiw. Efficient algorithms for Petersen's matching theorem. In Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pages 130-139, 1999.
4. E. W. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 1:269-271, 1959.
5. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification | a technique for speeding up dynamic graph algorithms. J. ACM, 44(5):669-696, 1997. See also FOCS'92.
6. B. Fortz and M. Thorup. Internet trafic engineering by optimizing OSPF weights. In Proc. 19th IEEE INFOCOM-Conf. Computer Communications, pages 519-528, 2000.
7. D. Frigioni, M. Ioředa, U. Nanni, and G. Pasqualone. Experimental analysis of dynamic algorithms for the single-source shortest path problem. ACM J. Experimental Algorithmics, 3, article 5, 1998.
8. H. N. Gabow. A matroid approach to finding edge connectivity and packing arborescences. J. Comp. Syst. Sc., 50:259-273, 1995.
9. H.N. Gabow, H. Kaplan, and R.E. Tarjan. Unique maximum matching algorithms. In Proc. 31st ACM Symp. on Theory of Computing, pages 70-78, 1999.
10. M.R. Henzinger, V. King, and T. Warnow. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica, 24(1):1-13, 1999.
11. J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proc. 30th ACM Symp. on Theory of Computing, pages 79-89, 1998.
12. S. Kannan, T. Warnow, and S. Yooseph. Computing the local consensus of trees. SIAM J. Computing, 27(6):1695-1724, 1998.
13. D. R. Karger. Using randomized sparsification to approximate minimum cuts. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 424-432, 1994.
14. D. R. Karger. Better random sampling algorithms for flows in undirected graphs. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pages 490-499, 1998.
15. D. R. Karger. Minimum cuts in near-linear time. J. ACM, 47(1), 2000.
16. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. 40th IEEE Symp. on Foundations of Computer Science, pages 81-89, 1999.
17. A. Kotzig. On the theory of finite graphs with a linear factor I. Mat.-Fyz. Časopis Slovensk. Akad. Vied, 9:73-91, 1959.
18. D. W. Matula. A linear time 2+ɛ approximation algorithm for edge connectivity. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pages 500-504, 1993.
19. J. T. Moy. OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, 1999.
20. H. Nagamochi and T. Ibaraki. Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7:583-596, 1992.
21. C. St. J. A. Nash-Williams. Edge disjoint spanning trees of finite graphs. J. London Math. Soc., 36:445-450, 1991.
22. J. Petersen. Die theorie der regulären graphs. Acta Mathematica, 15:193-220, 1891.
23. S. A. Plotkin, D. B. Shmoys, and É. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257-301, 1995.
24. G. Ramalingam and T. Reps. An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms, 21(2):267-305, 1996.
25. N. Young. Randomized rounding without solving the linear program. In Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 170-178, 1995.