Computing dominators in parallel

DOI10.1016/0020-0190(87)90136-0zbMath0653.68067OpenAlexW1988075678MaRDI QIDQ1108035

P. S. Gopalakrishnan, Shaunak R. Pawagi, I. V. Ramakrishnan

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90136-0

zbMATH Keywords

dominatorsparallel algorithmtime complexitytransitive closureparallel random access machinedirected acylic graphprocessor complexity

Mathematics Subject Classification ID

Related Items (2)

Efficient parallel algorithms for path problems in directed graphs ⋮ A uniform approach to semi-dynamic problems on digraphs

Cites Work

• Parallel computation and conflicts in memory access
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• On the Asymptotic Complexity of Matrix Multiplication
• The theory of languages
• Unnamed Item

This page was built for publication: Computing dominators in parallel