A data-parallel algorithm for minimum-width tree layout

DOI10.1016/S0020-0190(98)00081-7zbMATH Open1339.68304MaRDI QIDQ293301FDOQ293301

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

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
• 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

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)

Cites Work

• Pretty-printing of trees
• Title not available (Why is that?)
• Tidy Drawings of Trees

Cited In (2)

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

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)