E-resources
PDF-
Fernau, Henning
Lecture notes in computer science, 2006Book Chapter, Conference Proceeding
We analyze edge dominating set from a parameterized perspective. More specifically, we prove that this problem is in \documentclass12pt{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal{FPT}}$\end{document} for general (weighted) graphs. The corresponding algorithms rely on enumeration techniques. In particular, we show how the use of compact representations may speed up the decision algorithm.
