Library Automation and Digital Archive
LONTAR
Fakultas Ilmu Komputer
Universitas Indonesia

Pencarian Sederhana

Find Similar Add to Favorite

Call Number SEM-212
Collection Type Indeks Artikel prosiding/Sem
Title A linear-work parallel algorithm for finding minimum spanning trees
Author Richard Cole, Philip N. Klein, Robert E. Tarjan;
Publisher 6th Annual ACM Symposium on Parallel Algorithms and Architecture
Subject
Location
Lokasi : Perpustakaan Fakultas Ilmu Komputer
Nomor Panggil ID Koleksi Status
SEM-212 TERSEDIA
Tidak ada review pada koleksi ini: 55417
ABSTRACT

We give the first linear-work parallel algorithm for finding a minimum spanning tree. It is a randomized algorithm, and requires O(2log log n) expected time. It is a modification of the sequential linear-time algorithm of lein and Tarjan.