Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems

DOI10.7155/jgaa.00035zbMath0985.68093OpenAlexW2151202196MaRDI QIDQ2755062

Joseph (Seffi) Naor, Guy Even, Jon Feldman, Reuven Bar Yehuda

Publication date: 7 January 2002

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/49188

zbMATH Keywords

vertex ordering problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

This page was built for publication: Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems