Finding minimum spanning forests in logarithmic time aud linear work using . . .

Finding minimum spanning forests in logarithmic time aud linear work using . . . (1996)

Cached

Download Links

by Richard Cole , Philip N. Klein , Robert E. Tarjan

Citations:

BibTeX

@MISC{Cole96findingminimum,
    author = {Richard Cole and Philip N. Klein and Robert E. Tarjan},
    title = {Finding minimum spanning forests in logarithmic time aud linear work using . . . },
    year = {1996}
}

Bookmark

OpenURL

Abstract

Citations

285	Fast algorithms for finding nearest common ancestors - Harel, Tarjan - 1984
268	Parallel algorithms for sharedmemory machines - Karp, Ramachandran - 1990
161	On finding lowest common ancestors: simplification and parallelization - Schieber, Vishkin - 1988
141	Trans-dichotomous algorithms for minimum spanning trees and shortest paths - Fredman, Willard - 1990
108	An o(log n) parallel connectivity algorithm - Shiloach, Vishkin - 1982
98	A randomized lineartime algorithm to find minimum spanning trees - Karger, Klein, et al. - 1995
67	Finding the maximum, merging, and sorting in a parallel computation model - Shiloach, Vishkin - 1981
59	E cient parallel algorithms for some graph problems - Chin, Lam, et al. - 1982
58	Approximate and exact parallel scheduling with applications to list, tree, and graph problems - COLE, VISHIUN - 1986
44	Towards a theory of nearly constant time parallel algorithms - Gil, Matias, et al. - 1991
43	An optimal randomized parallel algorithm for finding connected components in a graph - Gazit - 1986
33	A simpler minimum spanning tree verification algorithm - King - 1997
30	New connectivity and MSF algorithms for shuffleexchange network and PRAM - Awerbuch, Shiloach - 1987
28	A Parallel Algorithm for Computing Minimum Spanning Trees - Johnson, Metaxas - 1995
13	Random sampling in matroids, with applications to graph connectivity and minimum spanning trees - KARGER - 1993
12	An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM - Halperin, Zwick - 1994
12	Fast efficient parallel algorithms for some graph problems - Savage, Ja'Ja - 1981
11	O jistem problemu minimalnim. Praca Moravske Prirodovedecke Spolecnosti, 3:37{58 - Boruvka - 1926
9	Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems - Halperin, Zwick - 1996
8	Parallel algorithms for finding the maximum and the median almost surely in constant time - Megiddo - 1982
8	Data Structures and Network Algorithms, Chapter 6 - Tarjan - 1983
5	Finding connected components in O(logn log log n) time - Chong, Lam - 1993
5	Tarjan, "Verification and sensitivity analysis of minimum spanning trees in linear time - Dixon, Rauch, et al. - 1992
4	Approximating, verifying, and constructing minimum spanmng forests - KARGER - 1992
3	Tarjan, "A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees - Klein, E - 1994
2	Tarjan, "A linear-work parallel algorithm for finding minimum spanning trees - Cole, Klein, et al. - 1994
2	Tarjan, "Optimal parallel verification of minimum spanning trees in logarithmic time - Dixon, E - 1993
2	Lecture Notes on Randomized Algorithms," Research Report RC - Raghavan - 1990
2	Approximating, verifying, and constructing minimum spanmng forest s,” manuscript - Iarger - 1992
1	Optimal randomized ERE\V PRAL1 algorithms for fincling spanning forests and for other basic graph connectivity y problems - Halperm, Zw, et al. - 1996
1	jist6m prob16mu minim41njm.” Prica Lio ru l’.sk~ Prz’rodo,rdec!s; Spolecnostz 6 - ‘CO - 1930
1	arger “Random sampling in matroids, with applications to graph connectivity and minimum spanning trees - R - 1993
1	Tarjan, “A randomized linear-time algorithm for finding minimum spanning trees - Wein, E - 1994
1	Parallel algorithms for finding the maximum and the median almost surely in constant time - Megidcfo - 1982
1	Lecture Notes on Randomized Algorithms,” Research Report RC - Raghavan
1	On finding lowest common am cestors: simplification and parallelization - Schieber, T
1	Data Str’uctur’es and )Vetwork .d[go?’ifhms, Chapter 6 - Tarjan - 1983