Pages that link to "Item:Q3474884"
From MaRDI portal
The following pages link to Planar Depth-First Search in $O(\log n)$ Parallel Time (Q3474884):
Displaying 19 items.
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- A random NC algorithm for depth first search (Q1104756) (← links)
- A linear-processor algorithm for depth-first search in planar graphs (Q1110342) (← links)
- A parallel algorithm for recognizing unordered depth-first search (Q1111396) (← links)
- Parallel depth first search. II: Analysis (Q1116344) (← links)
- Parallel search algorithms for graphs and trees (Q1204800) (← links)
- Distributed algorithms for depth-first search (Q1349993) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)
- Parallel Algorithms for Depth-First Searches I. Planar Graphs (Q3753502) (← links)
- IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH (Q4485123) (← links)
- A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH (Q4820076) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search (Q5949570) (← links)
- Depth-First Search in Directed Planar Graphs, Revisited (Q6168415) (← links)
