A unified FPT Algorithm for Width of Partition Functions - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

A unified FPT Algorithm for Width of Partition Functions

Abstract

During the last decades, several polynomial-time algorithms have been designed that decide if a graph has treewidth (resp., pathwidth, branchwidth, etc.) at most $k$, where $k$ is a fixed parameter. Amini {\it et al.} (to appear in SIAM J. Discrete Maths.) use the notions of partitioning-trees and partition functions as a generalized view of classical decompositions of graphs, namely tree-decomposition, path-decomposition, branch-decomposition, etc. In this paper, we propose a set of simple sufficient conditions on a partition function $\Phi$, that ensures the existence of a linear-time explicit algorithm deciding if a set $A$ has $\Phi$-width at most $k$ ($k$ fixed). In particular, the algorithm we propose unifies the existing algorithms for treewidth, pathwidth, linearwidth, branchwidth, carvingwidth and cutwidth. It also provides the first Fixed Parameter Tractable linear-time algorithm deciding if the $q$-branched treewidth, defined by Fomin {\it et al.} (Algorithmica 2007), of a graph is at most $k$ ($k$ and $q$ are fixed). Our decision algorithm can be turned into a constructive one by following the ideas of Bodlaender and Kloks (J. of Alg. 1996).
Fichier principal
Vignette du fichier
RR-6646.pdf (479.98 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00321766 , version 1 (15-09-2008)

Identifiers

  • HAL Id : inria-00321766 , version 1

Cite

Pascal Berthomé, Nicolas Nisse. A unified FPT Algorithm for Width of Partition Functions. [Research Report] RR-6646, INRIA. 2008, pp.36. ⟨inria-00321766⟩
192 View
79 Download

Share

Gmail Mastodon Facebook X LinkedIn More