A data-parallel algorithm for minimum-width tree layout

DOI10.1016/S0020-0190(98)00081-7MaRDI QIDQ293301zbMATH OpenFDO

Authors Wuu Yang

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098000817?np=y

zbMATH Keywords

PRAMdata-parallel algorithmsEREWtree layout

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient parallel algorithms for some tree layout problems
• Parallel algorithms for the minimum cut and the minimum length tree layout problems
• A Parallel Algorithm for Computing Minimum Spanning Trees
• scientific article; zbMATH DE number 88972
• Minimal spanning trees: An empirical investigation of parallel algorithms
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Parallel algorithms with optimal speedup for bounded treewidth
• scientific article; zbMATH DE number 1556480
• An optimal parallel algorithm for minimum spanning trees in planar graphs
• Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

Cites work

• scientific article; zbMATH DE number 52604 (Why is no real title available?)
• Pretty-printing of trees
• Tidy Drawings of Trees

Cited in

(2)

• Worst-case optimal tree layout in external memory
• Efficient parallel algorithms for some tree layout problems

This page was built for publication: A data-parallel algorithm for minimum-width tree layout

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293301)