Tractable Parameterizations for the Minimum Linear Arrangement Problem

DOI10.1145/2898352zbMath1427.68118OpenAlexW2346271234MaRDI QIDQ4973850

Michael R. Fellows, Frances A. Rosamond, Danny Hermelin, Hadas Shachnai

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2898352

zbMATH Keywords

fixed parameter tractabilityparameterized algorithmsminimum linear arrangement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges ⋮ On an ordering problem in weighted hypergraphs

This page was built for publication: Tractable Parameterizations for the Minimum Linear Arrangement Problem