Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests

DOI10.1006/jagm.2000.1146zbMath0974.68147OpenAlexW1999812064WikidataQ60299162 ScholiaQ60299162MaRDI QIDQ2731600

Uri Zwick, Shay Halperin

Publication date: 20 September 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1146

zbMATH Keywords

Eulerian graphsEuler tours

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Time-optimal construction of overlay networks ⋮ COLORING ALGORITHMS ON SUBCUBIC GRAPHS ⋮ Concurrent disjoint set union

This page was built for publication: Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests