Open access
Aug 2026
Small boundary: a family of linear-time greedy heuristics for the minimum linear arrangement problem
Small boundary (SB(k)), a family of linear-time greedy heuristics that guide vertex labeling through a prioritization scheme based on the structure of labeled and k levels of unlabeled vertex neighborhoods, is introduced.
S. G. D. de Oliveira, A. A. D. de Abreu
· Journal of Heuristics · 0 citations