An optimal parallel processor bound in strong orientation of an undirected graph

DOI10.1016/0020-0190(85)90082-1zbMath0572.68054OpenAlexW1991539193MaRDI QIDQ1062459

Yung Hyang Tsin

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90082-1

zbMATH Keywords

parallel computationanalysis of algorithmsPRAMundirected graphdense graphsparallel graph algorithmSIMD shared memory model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (1)

Parallel search algorithms for graphs and trees

Cites Work

• Parallel strong orientation of an undirected graph
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Finding Lowest Common Ancestors in Parallel
• Efficient parallel algorithms for some graph problems

This page was built for publication: An optimal parallel processor bound in strong orientation of an undirected graph