Optimal parallel algorithms on planar graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4060742
- An optimal parallel algorithm for minimum spanning trees in planar graphs
- A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
- scientific article; zbMATH DE number 3995071
- scientific article; zbMATH DE number 139775
Cites work
- An Efficient Parallel Biconnectivity Algorithm
- An O(logn) parallel connectivity algorithm
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Computing connected components on parallel computers
- Deterministic coin tossing with applications to optimal parallel list ranking
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Efficient parallel algorithms for some graph problems
- Faster optimal parallel prefix sums and list ranking
- scientific article; zbMATH DE number 3930349 (Why is no real title available?)
- scientific article; zbMATH DE number 4060742 (Why is no real title available?)
- scientific article; zbMATH DE number 4064468 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- On saving space in parallel computation
- On Synchronous Parallel Computations with Independent Probabilistic Choice
- Optimal Parallel 5-Colouring of Planar Graphs
- Parallel algorithms for the connected components and minimal spanning tree problems
- Parallel construction of subdivision hierarchies
- Parallel Symmetry-Breaking in Sparse Graphs
- Relations between Concurrent-Write Models of Parallel Computation
Cited in
(28)- An optimal parallel processor bound in strong orientation of an undirected graph
- An efficient parallel algorithm for planarity
- Improved deterministic parallel integer sorting
- Efficient parallel algorithms for shortest paths in planar digraphs
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
- Efficient computation of implicit representations of sparse graphs
- An optimal parallel algorithm for planar cycle separators
- Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph
- Parallel complexity of partitioning a planar graph into vertex-induced forests
- An optimal parallel algorithm for minimum spanning trees in planar graphs
- Parallel Algorithms for Depth-First Searches I. Planar Graphs
- scientific article; zbMATH DE number 4060742 (Why is no real title available?)
- A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
- Parallel algorithms for planar graph isomorphism and related problems
- scientific article; zbMATH DE number 4087453 (Why is no real title available?)
- Parallel Transitive Closure and Point Location in Planar Structures
- scientific article; zbMATH DE number 139775 (Why is no real title available?)
- Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
- Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees
- An optimal algorithm for extracting the regions of a plane graph
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
- Parallel algorithms with optimal speedup for bounded treewidth
- scientific article; zbMATH DE number 3995071 (Why is no real title available?)
- Improved parallel depth-first search in undirected planar graphs
- Fast and optimal simulations between CRCW PRAMs
- Optimal parallel algorithms for path problems on planar graphs
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
This page was built for publication: Optimal parallel algorithms on planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582094)
