Abstract
We present a first randomized O(log (κ) 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 finding spanning trees in random graphs.
Cite
CITATION STYLE
Dessmark, A., Dorgerloh, C., Lingas, A., & Wirtgen, J. (1998). Ultrafast randomized parallel construction and approximation algorithms for spanning forests in dense graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1388, pp. 392–399). Springer Verlag. https://doi.org/10.1007/3-540-64359-1_713
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
