Pages that link to "Item:Q1900892"
From MaRDI portal
The following pages link to An optimal parallel algorithm for planar cycle separators (Q1900892):
Displaying 7 items.
- Planar separators and parallel polygon triangulation. (Q960516) (← links)
- A linear-processor algorithm for depth-first search in planar graphs (Q1110342) (← links)
- A parallel algorithm for finding a triconnected component separator with an application (Q1339375) (← links)
- I/O-Efficient Planar Separators (Q3631891) (← links)
- A parallel approach to the Eulerian cycle problem (Q4805480) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)