Optimal sublogarithmic time parallel algorithms on rooted forests

DOI10.1007/S004530010012MaRDI QIDQ1977136zbMATH OpenOpenAlexFDO

Authors G. Sajith, Sanjeev Saxena

Publication date 18 December 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004530010012

zbMATH Keywords

sublogarithmic time optimal parallel algorithm

Mathematics Subject Classification ID

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

Recommendations

• Optimal parallel 3-coloring algorithm for rooted trees and its applications
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
• scientific article; zbMATH DE number 19774

Cited in

(1)

• Navigating Forest Straight-Line Programs in Constant Time

This page was built for publication: Optimal sublogarithmic time parallel algorithms on rooted forests

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