Pages that link to "Item:Q3753502"
From MaRDI portal
The following pages link to Parallel Algorithms for Depth-First Searches I. Planar Graphs (Q3753502):
Displaying 34 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 parallel search algorithm for directed acyclic graphs (Q795509) (← links)
- An external-memory depth-first search algorithm for general grid graphs (Q1022598) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- A new distributed depth-first-search algorithm (Q1062756) (← links)
- A note on parallel depth first search (Q1075058) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- A random NC algorithm for depth first search (Q1104756) (← links)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← 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)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- Parallel depth first search. I: Implementation (Q1116343) (← links)
- Parallel depth first search. II: Analysis (Q1116344) (← links)
- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm (Q1124337) (← links)
- A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) (← 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)
- Distributed algorithms for depth-first search (Q1349993) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Fault tolerant depth first search in undirected graphs: simple yet efficient (Q2149103) (← links)
- (Q3349963) (← 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)
- Via Detours to I/O-Efficient Shortest Paths (Q3644724) (← links)
- Parallel algorithms for a depth first search and a breadth first search (Q3802639) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Sublinear-time reductions for big data computing (Q5918726) (← 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)
- Randomized parallel algorithms (Q6560203) (← links)
