Minimum Linear Arrangement - algorithm, implementation, and experiments

This web page summarizes our work on the minimum linear arrangement problem. You can find here links to our paper, an implementation written by Jon Feldman and Zvika Brakerski, and experimental results.


Reuven Bar-Yehuda, Guy Even, Jon Feldman, and Seffi Naor, Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems, Journal of Graph Algorithms and Applications

Related Links


The program is writttten in C. A gzipped tar file with the sources and a short readme.


All the results in a tar file

About this document ...

Guy Even 2002-01-13