Finding minimum spanning forests in logarithmic time and linear work using random sampling

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We describe a randomized CRCW PRAM algorithm that finds a minimum spanning forest of an n-vertex graph in O(log n) time and linear work. This shaves a factor of 2log* n off the best previous running time for a linear-work algorithm. The novelty in our approach is to divide the computation into two phases, the first of which finds only a partial solution. This idea has been used previously in parallel connected components algorithms.

Original languageEnglish (US)
Title of host publicationAnnual ACM Symposium on Parallel Algorithms and Architectures
Editors Anon
Pages243-250
Number of pages8
StatePublished - 1996
EventProceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures - Padua, Italy
Duration: Jun 24 1996Jun 26 1996

Other

OtherProceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures
CityPadua, Italy
Period6/24/966/26/96

Fingerprint

Sampling

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Cole, R., Klein, P. N., & Tarjan, R. E. (1996). Finding minimum spanning forests in logarithmic time and linear work using random sampling. In Anon (Ed.), Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 243-250)

Finding minimum spanning forests in logarithmic time and linear work using random sampling. / Cole, Richard; Klein, Philip N.; Tarjan, Robert E.

Annual ACM Symposium on Parallel Algorithms and Architectures. ed. / Anon. 1996. p. 243-250.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R, Klein, PN & Tarjan, RE 1996, Finding minimum spanning forests in logarithmic time and linear work using random sampling. in Anon (ed.), Annual ACM Symposium on Parallel Algorithms and Architectures. pp. 243-250, Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures, Padua, Italy, 6/24/96.
Cole R, Klein PN, Tarjan RE. Finding minimum spanning forests in logarithmic time and linear work using random sampling. In Anon, editor, Annual ACM Symposium on Parallel Algorithms and Architectures. 1996. p. 243-250
Cole, Richard ; Klein, Philip N. ; Tarjan, Robert E. / Finding minimum spanning forests in logarithmic time and linear work using random sampling. Annual ACM Symposium on Parallel Algorithms and Architectures. editor / Anon. 1996. pp. 243-250
@inproceedings{5a1e955e7caf404d9509bbbaa1553799,
title = "Finding minimum spanning forests in logarithmic time and linear work using random sampling",
abstract = "We describe a randomized CRCW PRAM algorithm that finds a minimum spanning forest of an n-vertex graph in O(log n) time and linear work. This shaves a factor of 2log* n off the best previous running time for a linear-work algorithm. The novelty in our approach is to divide the computation into two phases, the first of which finds only a partial solution. This idea has been used previously in parallel connected components algorithms.",
author = "Richard Cole and Klein, {Philip N.} and Tarjan, {Robert E.}",
year = "1996",
language = "English (US)",
pages = "243--250",
editor = "Anon",
booktitle = "Annual ACM Symposium on Parallel Algorithms and Architectures",

}

TY - GEN

T1 - Finding minimum spanning forests in logarithmic time and linear work using random sampling

AU - Cole, Richard

AU - Klein, Philip N.

AU - Tarjan, Robert E.

PY - 1996

Y1 - 1996

N2 - We describe a randomized CRCW PRAM algorithm that finds a minimum spanning forest of an n-vertex graph in O(log n) time and linear work. This shaves a factor of 2log* n off the best previous running time for a linear-work algorithm. The novelty in our approach is to divide the computation into two phases, the first of which finds only a partial solution. This idea has been used previously in parallel connected components algorithms.

AB - We describe a randomized CRCW PRAM algorithm that finds a minimum spanning forest of an n-vertex graph in O(log n) time and linear work. This shaves a factor of 2log* n off the best previous running time for a linear-work algorithm. The novelty in our approach is to divide the computation into two phases, the first of which finds only a partial solution. This idea has been used previously in parallel connected components algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0030387155&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030387155&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030387155

SP - 243

EP - 250

BT - Annual ACM Symposium on Parallel Algorithms and Architectures

A2 - Anon, null

ER -