scientific article; zbMATH DE number 1419215

MaRDI QIDQ4942233zbMATH OpenFDO

Authors Carsten F. Dorgerloh, Jürgen Wirtgen, Anders Dessmark, Andrzej Lingas

Publication date 21 March 2000

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
• Parallel graph algorithms for hypercube computers
• scientific article; zbMATH DE number 871942
• Optimal randomized EREW PRAM algorithms for finding spanning forests
• Two minimum spanning forest algorithms on fixed-size hypercube computers

Cited in

(3)

• Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
• scientific article; zbMATH DE number 1117869 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942233)