Work

A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees

Year: 2017

Type: article

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.

Source: SIAM Journal on Computing

DOI: 10.1137/15m1046289

Authors: Juan Luis Esteban, Ramon Ferrer-i-Cancho

Institution: Universitat Politècnica de Catalunya

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Ministerio de Economía y Competitividad, Agència de Gestió d'Ajuts Universitaris i de Recerca

Awards: G130295011, G5975705685, G7986166557