97
Voted
IWPEC
15 years 7 months ago
2009 Springer 
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
IWPEC
15 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...
112
click to vote
IWPEC
15 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...
113
Voted
IWPEC
15 years 7 months ago
2009 Springer 
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
116
click to vote
IWPEC
15 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...
|
Applied Computing