Algorithms for Single Link Failure Recovery and Related Problems
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..
[2] Robert E. Tarjan,et al. Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees , 1982, Inf. Process. Lett..
[3] David R. Karger,et al. Finding the hidden path: time bounds for all-pairs shortest paths , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[4] Seth Pettie,et al. An optimal minimum spanning tree algorithm , 2000, JACM.
[5] Samir Khuller,et al. The complexity of finding most vital arcs and nodes , 1995 .
[6] Bernard Chazelle,et al. A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.
[7] Haim Kaplan,et al. Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators , 1998, STOC '98.
[8] A. K. Mittal,et al. The k most vital arcs in the shortest path problem , 1990 .
[9] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[10] Robert E. Tarjan,et al. A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets , 1979, J. Comput. Syst. Sci..
[11] Robert E. Tarjan,et al. Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time , 1992, SIAM J. Comput..
[12] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[13] Subhash Suri,et al. On the Difficulty of Some Shortest Path Problems , 2003, STACS.
[14] Hong Shen. Finding the k most vital edges with respect to minimum spanning tree , 1999, Acta Informatica.
[15] Weifa Liang. Finding the k most vital edges with respect to minimum spanning trees for fixed k , 2001, Discret. Appl. Math..
[16] Subhash Suri,et al. Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[17] Roberto Solis-Oba,et al. Increasing the weight of minimum spanning trees , 1996, SODA '96.
[18] Mikkel Thorup,et al. Undirected single source shortest paths in linear time , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[19] Michael L. Fredman,et al. Trans-dichotomous algorithms for minimum spanning trees and shortest paths , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[20] Amit M. Bhosle. Improved algorithms for replacement paths problems in restricted graphs , 2005, Oper. Res. Lett..
[21] Enrico Nardelli,et al. Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast , 2002, Algorithmica.
[22] Yijie Han. Deterministic sorting in O(nlog log n) time and linear space , 2002, STOC '02.
[23] Rasti Slosiar,et al. A polynomial-time algorithm for the establishment of primary and alternate paths in ATM networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[24] HanYijie. Deterministic sorting in O(nlog logn) time and linear space , 2004 .
[25] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.