A faster computation of the most vital edge of a shortest path
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Applications of Path Compression on Balanced Trees , 1979, JACM.
[2] R. Tarjan. Complexity of monotone networks for computing conjunctions , 1976 .
[3] Enrico Nardelli,et al. Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes , 1998, Inf. Process. Lett..
[4] A. K. Mittal,et al. The k most vital arcs in the shortest path problem , 1990 .
[5] Robert E. Tarjan,et al. A Note on Finding the Bridges of a Graph , 1974, Inf. Process. Lett..
[6] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[7] Mikkel Thorup. Floats, Integers, and Single Source Shortest Paths , 2000, J. Algorithms.