Pages that link to "Item:Q3798262"
From MaRDI portal
The following pages link to A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs (Q3798262):
Displaying 8 items.
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
- Not all planar digraphs have small cycle separators (Q1201868) (← links)
- Parallel search algorithms for graphs and trees (Q1204800) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
