Documents Related by Co-Citation

76 A minimum spanning tree algorithm with inverse-Ackermann typecomplexity – B CHAZELLE
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
115 A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees – David R. Karger , Philip N. Klein, Robert E. Tarjan - 1994
18 A linear-time algorithm for minimum spanning tree – P N Klein, R E Tarjan - 1993
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
162 Trans-dichotomous algorithms for minimum spanning trees and shortest paths – M Fredman, D E Willard - 1990
24 Improved shortest paths on the word RAM – Torben Hagerup, Fachbereich Informatik
19 Computing Shortest Paths with Comparisons and Additions – Seth Pettie , Vijaya Ramachandran - 2002
64 Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths – David R. Karger, Daphne Koller, Steven J. Phillips - 1993
54 Verification and Sensitivity Analysis Of Minimum Spanning Trees In Linear Time – Brandon Dixon, Monika Rauch, Robert, Robert E. Tarjan - 1992
30 A scaling algorithm for weighted matching on general graphs – H N Gabow - 1985
29 Sensitivty analysis of minimum spanning trees and shortest path trees – R E Tarjan - 1982
92 Undirected single-source shortest paths with positive integer weights in linear time – M Thorup - 1999
49 Undirected Single Source Shortest Paths in Linear Time – Mikkel Thorup - 1997
10 Finding real-valued single-source shortest paths in o(n³) expected time – Stavros G. Kolliopoulos, Clifford Stein - 1998
43 A new upper bound on the complexity of the all pairs shortest path problem – T Takaoka - 1992
1427 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
63 New bounds on the complexity of the shortest path problem – M Fredman - 1976
27 Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators – Adam L. Buchsbaum , Haim Kaplan, Anne Rogers, Jeffery R. Westbrook - 1998