Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value

DOI10.1007/s00224-007-9037-2zbMath1277.68223OpenAlexW1974749770MaRDI QIDQ385510

Stefan Szeider, Anders Yeo, Arash Rafiey, Gregory Gutin

Publication date: 2 December 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9037-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The \(S\)-\textsc{labeling} problem: an algorithmic tour

Cites Work

• The linear arrangement problem parameterized above guaranteed value

This page was built for publication: Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value