Lower bounds on parallel algorithms for finding the first maximal independent set
From MaRDI portal
Publication:1072703
DOI10.1016/0020-0190(86)90145-6zbMath0587.68044OpenAlexW1965151869MaRDI QIDQ1072703
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90145-6
Related Items (2)
\(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems ⋮ The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
Cites Work
This page was built for publication: Lower bounds on parallel algorithms for finding the first maximal independent set
