|
595
|
LEDA: A Platform for Combinatorial and Geometric Computing
– Kurt Mehlhorn, Stefan Näher, Christian Uhrig
- 1999
|
|
30
|
Pairing heaps: experiments and analysis
– J Stasko, J Vitter
- 1987
|
|
124
|
Shortest Paths Algorithms: Theory And Experimental Evaluation
– Boris Cherkassky, Andrew V. Goldberg, Tomasz Radzik
- 1993
|
|
16
|
Parallel implementation of Bor˚uvka’s minimum spanning tree algorithm
– S Chung, A Condon
- 1996
|
|
493
|
Fibonacci heaps and their uses in improved network optimization algorithms
– M L Fredman, R E Tarjan
- 1987
|
|
98
|
A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees
– David R. Karger , Philip N. Klein, Robert E. Tarjan
- 1994
|
|
104
|
The influence of caches on the performance of sorting
– Anthony LaMarca, Richard E. Ladner
- 1997
|
|
66
|
The Influence of Caches on the Performance of Heaps
– Anthony LaMarca , Richard E. Ladner
|
|
12
|
Connected Components Algorithms For Mesh-Connected Parallel Computers
– Steve Goddard, Subodh Kumar, Jan, Jan F. Prins
- 1995
|
|
30
|
A Comparison of Data-Parallel Algorithms for Connected Components
– John Greiner
- 1994
|
|
22
|
Parallel Implementation of Algorithms for Finding Connected Components in Graphs
– Tsan-Sheng Hsu, Vijaya Ramachandran, Nathaniel Dean
- 1997
|
|
17
|
Connected Components on Distributed Memory Machines
– Arvind Krishnamurthy, Steven S. Lumetta, David E. Culler, Katherine Yelick
- 1994
|
|
7320
|
Introduction to Algorithms
– T H Cormen, C E Leiserson, R L Rivest, C Stein
- 2001
|
|
46
|
Fast Priority Queues for Cached Memory
– Peter Sanders
- 1999
|
|
14
|
Improved upper bounds for pairing heaps
– J Iacono
|
|
43
|
Self-adjusting heaps
– D Sleater, R Tarjan
- 1986
|
|
334
|
Self-adjusting binary search trees
– D D AND TARJAN SLEATOR, R E
- 1985
|
|
36
|
Experimental Study of Minimum Cut Algorithms
– Chandra S. Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Cliff Stein
- 1997
|
|
7
|
O jistém problému minimálním. Práca Moravské P˘rírodovĕdecké Spole˘cnosti 6
– V Jarník
- 1930
|
