Worst-case update times for fully-dynamic all-pairs shortest paths
暂无分享,去创建一个
[1] George S. Lueker,et al. Adding range restriction capability to dynamic data structures , 1985, JACM.
[2] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[3] Uri Zwick,et al. Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs , 2004, FOCS.
[4] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[5] Monika Henzinger,et al. Randomized dynamic graph algorithms with polylogarithmic time per operation , 1995, STOC '95.
[6] Greg N. Frederickson,et al. Data structures for on-line updating of minimum spanning trees , 1983, STOC.
[7] Norbert Blum,et al. On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem , 1986, SIAM J. Comput..
[8] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[9] Greg N. Frederickson,et al. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..
[10] Piotr Sankowski,et al. Dynamic transitive closure via dynamic matrix inverse: extended abstract , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[11] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[12] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.
[13] Mikkel Thorup,et al. Oracles for distances avoiding a link-failure , 2002, SODA '02.
[14] Liam Roditty,et al. A faster and simpler fully dynamic transitive closure , 2003, SODA '03.
[15] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 1998, STOC '98.
[16] Mikkel Thorup,et al. Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles , 2004, SWAT.
[17] Mark H. Overmars,et al. A balanced search tree with O(1) worst-case update time , 1988, Acta Informatica.
[18] Giuseppe F. Italiano,et al. A new approach to dynamic all pairs shortest paths , 2004, JACM.
[19] Christos Makris,et al. Optimal finger search trees in the pointer machine , 2002, Symposium on the Theory of Computing.
[20] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[21] Michael L. Fredman,et al. New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..
[22] Giuseppe F. Italiano,et al. Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[23] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[24] M. AdelsonVelskii,et al. AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .
[25] Monika Henzinger,et al. Maintaining Minimum Spanning Forests in Dynamic Graphs , 2001, SIAM J. Comput..
[26] Valerie King,et al. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[27] David Eppstein,et al. Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[28] Piotr Sankowski,et al. Dynamic Transitive Closure via Dynamic Matrix Inverse , 2004 .
[29] Michael E. Saks,et al. The cell probe complexity of dynamic data structures , 1989, STOC '89.