research unit 1
 

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit Aigaion.nl.SourceForge.hetLogo

Publication

Type of publication:Article
Entered by:
TitleParallel Processing Letters
Bibtex cite IDRACTI-RU1-1998-7
Journal Parallel Processing Letters
Year published 1998
Volume 7
Number 1
Pages 25-37
Keywords Minimum spanning tree,parallel random access machine
Abstract
Two simple and work-efficient parallel algorithms for the minimum spanning tree problem are presented. Both algorithms perform O( m log n ) work. The first algorithm runs in O( log^2 n ) time on an EREW PRAM while the second algorithm runs in O( log n ) time on a Common CRCW PRAM.
Authors
Zaroliagis, Christos
Topics
Top
BibTeXBibTeX
RISRIS
Attachments
 simple.pdf (main file)
 
Publication ID859