The Linear Arrangement Problem Parameterized Above Guaranteed Value
From MaRDI portal
Publication:3434570
DOI10.1007/11758471_34zbMath1183.68428OpenAlexW1535048320MaRDI QIDQ3434570
Gregory Gutin, Stefan Szeider, Anders Yeo, Arash Rafiey
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758471_34
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 (3)
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations ⋮ Parameterized algorithmics for linear arrangement problems ⋮ Parameterizing above or below guaranteed values
This page was built for publication: The Linear Arrangement Problem Parameterized Above Guaranteed Value
