How to Swap a Failing Edge of a Single Source Shortest Paths Tree
暂无分享,去创建一个
[1] Enrico Nardelli,et al. Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures , 1998, J. Graph Algorithms Appl..
[2] Samir Khuller,et al. The complexity of finding most vital arcs and nodes , 1995 .
[3] Giuseppe F. Italiano,et al. Maintaining Spanning Trees of Small Diameter , 1994, ICALP.
[4] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[5] M. Grötschel,et al. Chapter 10 Design of survivable networks , 1995 .
[6] Daniele Frigioni,et al. Fully dynamic output bounded single source shortest path problem , 1996, SODA '96.
[7] M. Stoer. Design of Survivable Networks , 1993 .
[8] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[9] Robert E. Tarjan,et al. Applications of Path Compression on Balanced Trees , 1979, JACM.
[10] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..