Parallel Algorithms for Depth-First Searches I. Planar Graphs
From MaRDI portal
(Redirected from Publication:3753502)
Recommendations
- Improved parallel depth-first search in undirected planar graphs
- Planar Depth-First Search in O(\log n) Parallel Time
- Parallel algorithms for a depth first search and a breadth first search
- Parallel Depth-First Search in General Directed Graphs
- A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
- Efficient parallel algorithms for planar st-graphs
- scientific article; zbMATH DE number 4060742
- Optimal parallel algorithms on planar graphs
- Parallel breadth-first search algorithms for trees and graphs
- Efficient parallel algorithms for shortest paths in planar graphs
Cited in
(38)- Depth-First Search in Directed Planar Graphs, Revisited
- A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
- Randomized parallel algorithms
- An external-memory depth-first search algorithm for general grid graphs
- Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees
- A parallel algorithm for recognizing unordered depth-first search
- Planar Strong Connectivity Helps in Parallel Depth-First Search
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Efficient parallel algorithms for breadth first spanning forests of general graphs
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs
- An optimal parallel algorithm for planar cycle separators
- Depth-first search is inherently sequential
- A random NC algorithm for depth first search
- A linear-processor algorithm for depth-first search in planar graphs
- On finding optimal and near-optimal lineal spanning trees
- Fault tolerant depth first search in undirected graphs: simple yet efficient
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Improved parallel depth-first search in undirected planar graphs
- Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search
- Parallel depth first search. I: Implementation
- Parallel search algorithms for graphs and trees
- A new distributed depth-first-search algorithm
- Sublinear-time reductions for big data computing
- A model classifying algorithms as inherently sequential with applications to graph searching
- Via Detours to I/O-Efficient Shortest Paths
- An efficient parallel algorithm for shifting the root of a depth first spanning tree
- Parallel algorithms for a depth first search and a breadth first search
- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
- Parallel depth first search. II: Analysis
- Not all planar digraphs have small cycle separators
- Subtree isomorphism is NC reducible to bipartite perfect matching
- A parallel search algorithm for directed acyclic graphs
- scientific article; zbMATH DE number 4201596 (Why is no real title available?)
- scientific article; zbMATH DE number 3949734 (Why is no real title available?)
- A note on parallel depth first search
- A parallel algorithm for the maximal path problem
- Planar Depth-First Search in O(\log n) Parallel Time
This page was built for publication: Parallel Algorithms for Depth-First Searches I. Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753502)
