Parallel strong orientation of an undirected graph

DOI10.1016/0020-0190(84)90072-3zbMath0532.68065OpenAlexW2076461794MaRDI QIDQ789182

Mikhail J. Atallah

Publication date: 1984

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

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1361&context=cstech

zbMATH Keywords

parallel computationparallel algorithmgraph algorithmsstrong orientationshared memory model

Mathematics Subject Classification ID

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

Related Items (6)

On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets ⋮ On efficient parallel strong orientation ⋮ Parallel algorithms for connectivity problems in graph theory ⋮ Parallel search algorithms for graphs and trees ⋮ Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms ⋮ An optimal parallel processor bound in strong orientation of an undirected graph

Cites Work

• Unnamed Item
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• Parallel Algorithms in Graph Theory: Planarity Testing
• New Parallel-Sorting Schemes

This page was built for publication: Parallel strong orientation of an undirected graph