Alexandre A. A. M. de Abreu

Small boundary: a family of linear-time greedy heuristics for the minimum linear arrangement problem

Abstract This paper addresses the minimum linear arrangement problem, a classical graph layout problem in which the objective is to minimize the sum of absolute differences between the labels assigned to adjacent vertices in undirected graphs. The paper introduces small boundary...