Efficient parallel algorithms for some tree layout problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 54593
- Parallel algorithms for the minimum cut and the minimum length tree layout problems
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Parallel algorithms with optimal speedup for bounded treewidth
- Parallel algorithms for tree traversals
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Tree-based parallel algorithm design
- Parallel algorithms for tree accumulations
- A data-parallel algorithm for minimum-width tree layout
Cites work
- scientific article; zbMATH DE number 3956440 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Minimum Linear Arrangement Algorithm for Undirected Trees
- A simple parallel tree contraction algorithm
- Graph layout problems
- Optimal Linear Ordering
- Optimal numberings and isoperimetric problems on graphs
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
Cited in
(7)- An optimal parallel algorithm forc-vertex-ranking of trees
- Tree-based parallel algorithm design
- A simple optimal parallel algorithm for a core of a tree
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- A data-parallel algorithm for minimum-width tree layout
- Tree transformation problem in microparallelism algorithms
- The parallel complexity of tree embedding problems (extended abstract)
This page was built for publication: Efficient parallel algorithms for some tree layout problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085718)
