Verification and Sensitivity Analysis Of Minimum Spanning Trees In Linear Time (1992)

Cached

Download Links

by Brandon Dixon , Monika Rauch , Robert , Robert E. Tarjan
Venue:SIAM J. Comput
Citations:54 - 2 self

Documents Related by Co-Citation

86 Applications of path compressions on balanced trees – R E Tarjan - 1979
115 A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees – David R. Karger , Philip N. Klein, Robert E. Tarjan - 1994
185 On Finding Lowest Common Ancestors: Simplification and Parallelization – B Schieber, U Vishkin - 1988
22 LINEAR VERIFICATION FOR SPANNING TREES – J. Komlos - 1985
37 A Simpler Minimum Spanning Tree Verification Algorithm – Valerie King - 1995
153 Data structures for on-line updating of minimum spanning trees, with applications – G N Frederickson
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
82 Efficient Algorithms for Finding Minimum Spanning Trees – H N Gabow, Z Galil, T Spencer, R E Tarjan - 1986
335 Fast algorithms for finding nearest common ancestor – D Harel, R E Tarjan - 1984
162 Trans-dichotomous algorithms for minimum spanning trees and shortest paths – M Fredman, D E Willard - 1990
439 On the shortest spanning subtree of a graph and the traveling salesman problem – J B Kruskal - 1956
1402 Network Flows: Theory, Algorithms, and Applications – R K Ahuja, T L Magnanti, J B Orlin - 1993
255 Efficiency of a good but not linear set-union algorithm – R E Tarjan - 1975
1132 Graph Theory – F Harary - 1969
29 Sensitivty analysis of minimum spanning trees and shortest path trees – R E Tarjan - 1982
534 Shortest connection networks and some generalizations – R Prim - 1957
607 Data Structures and Network Algorithms – R E Tarjan - 1983
76 Balanced Matroids – Tomas Feder, Milena Mihail
1849 On the Evolution of Random Graphs – P. Erdős, A Rényi - 1960