✦ LIBER ✦

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

✍ Scribed by Chung and Vijaya

Book ID: 120136574
Publisher: Springer
Year: 2003
Tongue: English
Weight: 72 KB
Volume: 35
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-002-0998-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Randomized EREW PRAM Algorithms

Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests

✍ Shay Halperin; Uri Zwick 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 384 KB

We present the first randomized O log n time and O m + n work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = V E with n vertices and m edges. Our algorithm is optimal with respect to time, work, and space. As a consequence we get optimal randomized EREW PRAM algorithms

A randomized linear-time algorithm to fi

A randomized linear-time algorithm to find minimum spanning trees

✍ Karger, David R.; Klein, Philip N.; Tarjan, Robert E. 📂 Article 📅 1995 🏛 Association for Computing Machinery 🌐 English ⚖ 619 KB

A Randomized Time-Work Optimal Parallel

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

✍ Pettie, Seth; Ramachandran, Vijaya 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 210 KB

A linear-time algorithm for finding a mi

A linear-time algorithm for finding a minimum spanning pseudoforest

✍ Harold N. Gabow; Robert E. Tarjan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 460 KB

A linear algorithm to determine minimal

A linear algorithm to determine minimal spanning forests in chain graphs

✍ F. Luccio; L. Pagli 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 442 KB

A linear-time algorithm to find a pair o

A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph

✍ Kristóf Bérczi; Satoru Fujishige; Naoyuki Kamiyama 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 185 KB