A correction on Shiloach's algorithm for minimum linear arrangement of trees
Not on the map. Why?
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.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Nov 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1.
3 papers.