Parallel strong orientation on a mesh connected computer

DOI10.1016/S0167-8191(05)80055-9MaRDI QIDQ1179214zbMATH OpenFDO

Authors Manfred Schimmler

Publication date 26 June 1992

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

transitive closurepathbreadth first spanning tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• An optimal parallel processor bound in strong orientation of an undirected graph
• Parallel strong orientation of an undirected graph
• Fast parallel strong orientation of mixed graphs and related augmentation problems
• Parallel algorithms for connectivity problems in graph theory
• Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components

Cited in

(3)

• Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees
• Parallel strong orientation of an undirected graph
• Strongly connected orientations of plane graphs

This page was built for publication: Parallel strong orientation on a mesh connected computer

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