Pages that link to "Item:Q5060132"
From MaRDI portal
The following pages link to Improved parallel depth-first search in undirected planar graphs (Q5060132):
Displaying 6 items.
- A parallel search algorithm for directed acyclic graphs (Q795509) (← links)
- A linear-processor algorithm for depth-first search in planar graphs (Q1110342) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Planar Depth-First Search in $O(\log n)$ Parallel Time (Q3474884) (← links)
- Parallel Algorithms for Depth-First Searches I. Planar Graphs (Q3753502) (← links)
- Depth-First Search in Directed Planar Graphs, Revisited (Q6168415) (← links)