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 4 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)
- Fast and compact planar embeddings (Q5918983) (← links)
