Pages that link to "Item:Q1110342"
From MaRDI portal
The following pages link to A linear-processor algorithm for depth-first search in planar graphs (Q1110342):
Displaying 8 items.
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- Not all planar digraphs have small cycle separators (Q1201868) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (Q3357536) (← links)
- Planar Depth-First Search in $O(\log n)$ Parallel Time (Q3474884) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- Depth-First Search in Directed Planar Graphs, Revisited (Q6168415) (← links)