Pages that link to "Item:Q290218"
From MaRDI portal
The following pages link to An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218):
Displaying 4 items.
- Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538) (← links)
- An improved parallel algorithm that computes the BFS numbering of a directed graph (Q1111392) (← links)
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (Q1313714) (← links)
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318) (← links)