IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...