Parallel algorithms for the minimum cut and the minimum length tree layout problems

DOI10.1016/S0304-3975(96)00274-5zbMath0901.68082OpenAlexW2086214832MaRDI QIDQ1391312

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

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00274-5

zbMATH Keywords

parallel algorithmsminimum cut linear arrangement problems

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (2)

A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees ⋮ A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem

Cites Work

• A polynomial algorithm for the min-cut linear arrangement of 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
• Unnamed Item

This page was built for publication: Parallel algorithms for the minimum cut and the minimum length tree layout problems