paper

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

arXiv:1511.01061 · doi:10.1137/15M1046289

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.

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

References in corpus (1)

Cited by in corpus (2)