Parallel algorithms with optimal speedup for bounded treewidth
From MaRDI portal
Recommendations
Cites work
- A linear time algorithm for finding tree-decompositions of small treewidth
- A simple parallel tree contraction algorithm
- An algebraic theory of graph reduction
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Bounded Tree-Width and LOGCFL
- Complexity of Finding Embeddings in a k-Tree
- Deterministic coin tossing with applications to optimal parallel list ranking
- Graph minors. XIII: The disjoint paths problem
- scientific article; zbMATH DE number 176761 (Why is no real title available?)
- scientific article; zbMATH DE number 176762 (Why is no real title available?)
- scientific article; zbMATH DE number 910923 (Why is no real title available?)
- Optimal Parallel 5-Colouring of Planar Graphs
- Optimal parallel algorithms on planar graphs
- Parallel Symmetry-Breaking in Sparse Graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Cited in
(28)- Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
- Breadth-first traversal of trees and integer sorting in parallel
- Optimal parallel algorithms for forest and term matching
- Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
- A simple optimal parallel algorithm for a core of a tree
- Treewidth for graphs with small chordality
- An algorithm for the Tutte polynomials of graphs of bounded treewidth
- Reduction algorithms for graphs of small treewidth
- Faster algorithms for quantitative verification in bounded treewidth graphs
- A data-parallel algorithm for minimum-width tree layout
- Treewidth computation and kernelization in the parallel external memory model
- Optimal parallel generation of a computation tree form
- OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- scientific article; zbMATH DE number 1107730 (Why is no real title available?)
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Computing treewidth on the GPU
- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
- Parallel algorithms for series parallel graphs and graphs with treewidth two
- Fast parallel reordering and isomorphism testing of \(k\)-trees
- Computing LOGCFL certificates
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
- Efficient parallel algorithms for some tree layout problems
- Optimal parallel shortest paths in small treewidth digraphs
- On reduction algorithms for graphs with small treewidth
- Reduction algorithms for constructing solutions in graphs with small treewidth
- NC-algorithms for graphs with small treewidth
- An optimal parallel algorithm forc-vertex-ranking of trees
This page was built for publication: Parallel algorithms with optimal speedup for bounded treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645184)
