An optimal parallel algorithm for planar cycle separators
From MaRDI portal
Recommendations
- Improved parallel depth-first search in undirected planar graphs
- A linear-processor algorithm for depth-first search in planar graphs
- A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
- scientific article; zbMATH DE number 4064511
- Optimal parallel algorithms on planar graphs
Cites work
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 3900787 (Why is no real title available?)
- scientific article; zbMATH DE number 4064466 (Why is no real title available?)
- scientific article; zbMATH DE number 4064511 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
- A linear-processor algorithm for depth-first search in planar graphs
- A random NC algorithm for depth first search
- A simple parallel tree contraction algorithm
- Depth-First Search and Linear Graph Algorithms
- Depth-first search is inherently sequential
- Deterministic parallel list ranking
- Efficient parallel algorithms for series parallel graphs
- Faster optimal parallel prefix sums and list ranking
- Finding Euler tours in parallel
- Finding small simple cycle separators for 2-connected planar graphs
- Introduction to algorithms.
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
- Optimal parallel algorithms on planar graphs
- Parallel Algorithms for Depth-First Searches I. Planar Graphs
- Parallel Depth-First Search in General Directed Graphs
- Parallel Prefix Computation
- Parallel Tree Contraction Part 2: Further Applications
- Parallel algorithms for planar graph isomorphism and related problems
- Planar Depth-First Search in $O(\log n)$ Parallel Time
- Planar Strong Connectivity Helps in Parallel Depth-First Search
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
Cited in
(11)- A parallel approach to the Eulerian cycle problem
- Improved parallel depth-first search in undirected planar graphs
- An optimal algorithm for extracting the regions of a plane graph
- Planar separators and parallel polygon triangulation.
- scientific article; zbMATH DE number 4060742 (Why is no real title available?)
- Parallel Depth-First Search in General Directed Graphs
- I/O-Efficient Planar Separators
- scientific article; zbMATH DE number 4064511 (Why is no real title available?)
- Parallel algorithms for planar graph isomorphism and related problems
- scientific article; zbMATH DE number 1760038 (Why is no real title available?)
- A linear-processor algorithm for depth-first search in planar graphs
This page was built for publication: An optimal parallel algorithm for planar cycle separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900892)
