A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

Vijaya Chung

Journal Title: Algorithmica

Date: 2003

Volume: 35

Issue: 3

p. 257 - 268

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.cs.utexas.edu/users/vlr/papers/mst97.pdf

http://www.cs.utexas.edu/users/vlr/papers/mst97.ps

For further information about this item go to:

http://link.springer.de/link/service/journals/00453/contents/02/0998/index.html

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12