Efficient parallel algorithms for some tree layout problems

DOI10.1007/bfb0030846zbMath1527.68159OpenAlexW1560100202MaRDI QIDQ6085718

Paul G. Spirakis, Alan M. Gibbons, Maria J. Serna, Grammati E. Pantziou, Josep Diaz, Jacobo Toran

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030846

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient parallel algorithms for some tree layout problems