Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs

We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a randomized Olog logn time and Onlogn work CREW-PRAM algorithm for nding spanning trees in random graphs.

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas, Juergen Wirtgen
• Keywords: Distributed And Parallel Computing, IPPS 1998, Randomized Olog Logn, Undirected Dense Graph, Work Crcwpram Algorithm