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

arXiv: https://arxiv.org/abs/1511.01061 · HTML: https://mlsanity.com/paper/1511.01061/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Nov 2015.

## Built on by (most cited first, 3 of 3)

- [Minimum projective linearizations of trees in linear time](https://mlsanity.com/paper/2102.03277/) (2021)
- [The Linear Arrangement Library. A new tool for research on syntactic dependency structures](https://mlsanity.com/paper/2112.02512/) (2021)
- [The distribution of syntactic dependency distances](https://mlsanity.com/paper/2211.14620/) (2022)

## Abstract (arXiv)

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.