A correction on Shiloach's algorithm for minimum linear arrangement of trees
Data Structures and Algorithms
2020-09-24 v2
Abstract
More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on subsequent literature. We also improve some aspects of the notation.
Keywords
Cite
@article{arxiv.1511.01061,
title = {A correction on Shiloach's algorithm for minimum linear arrangement of trees},
author = {Juan Luis Esteban and Ramon Ferrer-i-Cancho},
journal= {arXiv preprint arXiv:1511.01061},
year = {2020}
}
Comments
A new introductory paragraph has been added; error solutions and notation improvements are discussed with more depth