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

DOI10.1016/S0020-0190(97)00009-4zbMATH Open1337.68284OpenAlexW2053724095MaRDI QIDQ290218FDOQ290218

F. R. Hsu, H. S. Chao, R. C. T. 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

Recommendations

• Efficient parallel algorithms for permutation graphs
• scientific article
• Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
• Parallel breadth-first search algorithms for trees and graphs
• An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs

zbMATH Keywords

parallel algorithmspermutation graphsbreadth-first search trees

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
• Title not available (Why is that?)
• Efficient parallel algorithms for permutation graphs
• An Efficient Parallel Biconnectivity Algorithm

Cited In (5)

• An improved parallel algorithm that computes the BFS numbering of a directed graph
• 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
• Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
• Parallel breadth-first search algorithms for trees and graphs

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

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