Bandwidth on AT-free graphs |
| |
Authors: | Petr Golovach Dieter Kratsch |
| |
Affiliation: | a Department of Informatics, University of Bergen, 5020 Bergen, Norwayb Laboratoire d’Informatique Théorique et Appliquée, Université Paul Verlaine-Metz, 57045 Metz Cedex 01, France |
| |
Abstract: | We study the classical Bandwidth problem from the viewpoint of parametrised algorithms. Given a graph G=(V,E) and a positive integer k, the Bandwidth problem asks whether there exists a bijective function β:{1,…,∣V∣}→V such that for every edge uv∈E, ∣β−1(u)−β−1(v)∣≤k. It is known that under standard complexity assumptions, no algorithm for Bandwidth with running time of the form f(k)nO(1) exists, even when the input is restricted to trees. We initiate the search for classes of graphs where such algorithms do exist. We present an algorithm with running time n⋅2O(klogk) for Bandwidth on AT-free graphs, a well-studied graph class that contains interval, permutation, and cocomparability graphs. Our result is the first non-trivial algorithm that shows fixed-parameter tractability of Bandwidth on a graph class on which the problem remains NP-complete. |
| |
Keywords: | Algorithm Fixed-parameter tractable Bandwidth AT-free graph |
本文献已被 ScienceDirect 等数据库收录! |
|