A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees
Juan Luis Esteban, Ramon Ferrer‐i‐Cancho · SIAM Journal on Computing · 2017
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.