Parameterized algorithmics for linear arrangement problems

We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for these problems. However, the analysis of these algorithms is sometimes not so easy. Key words: Parameterized algorithms, linear arrangement problems

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Henning Fernau
• Keywords: DAM 2008, Linear Arrangement, Problems, Simple Search Tree