Loading...
Please wait, while we are loading the content...
Similar Documents
Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Dessmark, Anders Dorgerloh, Carsten Lingas, Andrzej Wirtgen, Jürgen |
| Description | We present a first randomized O#log #k# n# time and O#n+m#work CRCWPRAM algorithm for finding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a randomized O#log log n# time and O#n log n#work CREW-PRAM algorithm for #nding spanning trees in random graphs. |
| File Format | |
| Language | English |
| Publisher Date | 1998-01-01 |
| Publisher Institution | IN DENSE GRAPHS. PROC. WORKSHOP ON PARALLEL RANDOMIZED ALGORITHMS |
| Access Restriction | Open |
| Subject Keyword | Ultrafast Randomized Parallel Construction Log Time Log Work Crew-pram Algorithm Random Graph Undirected Dense Graph Dense Graph Approximation Algorithm Work Crcwpram Algorithm Randomized Log Log Time |
| Content Type | Text |
| Resource Type | Article |