A correction on Shiloach's algorithm for minimum linear arrangement of trees

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.

A new introductory paragraph has been added; error solutions and notation improvements are discussed with more depth

References in corpus (1)

• The scaling of the minimum sum of edge lengths in uniformly random trees

Cited by in corpus (2)

• Bounds of the sum of edge lengths in linear arrangements of trees
• Reappraising the distribution of the number of edge crossings of graphs on a sphere