Fast parallel strong orientation of mixed graphs and related augmentation problems

DOI10.1016/0196-6774(88)90038-7MaRDI QIDQ3828023zbMATH OpenOpenAlexFDO

Authors Danny Soroker

Publication date 1988

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(88)90038-7

zbMATH Keywords

algorithmstrong orientation problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximation algorithms for orienting mixed graphs
• Approximation algorithms for orienting mixed graphs
• An 0(log n) parallel algorithm for strong connectivity augmentation problem
• Improved approximation for orienting mixed graphs
• Improved approximation for orienting mixed graphs
• scientific article; zbMATH DE number 4068310
• On 2-strong connectivity orientations of mixed graphs and related problems
• An optimal parallel processor bound in strong orientation of an undirected graph
• Parallel strong orientation of an undirected graph
• Fast-mixed searching and related problems on graphs

Cited in

(8)

• An optimal parallel processor bound in strong orientation of an undirected graph
• On orientations and shortest paths
• Parallel strong orientation on a mesh connected computer
• Making bidirected graphs strongly connected
• Improved approximation for orienting mixed graphs
• Strongly connected orientations of mixed multigraphs
• Connected reorientations of mixed multigraphs
• One-way trail orientations

This page was built for publication: Fast parallel strong orientation of mixed graphs and related augmentation problems

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