An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs

DOI10.1016/S0020-0190(97)00009-4zbMath1337.68284OpenAlexW2053724095MaRDI QIDQ290218

H. S. Chao, Fang-Rong Hsu, Richard Chia-Tung Lee

Publication date: 1 June 2016

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00009-4

zbMATH Keywords

parallel algorithmspermutation graphsbreadth-first search trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (2)

Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs ⋮ Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time

Cites Work

• Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
• Efficient parallel algorithms for permutation graphs
• An Efficient Parallel Biconnectivity Algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs