332 search results - page 17 / 67 » Parameterized Graph Separation Problems |
123
click to vote
CONCUR
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
VC
2008
14 years 11 months ago
2008
In real-time animation systems, motion interpolation techniques are widely used for their controllability and efficiency. The techniques sample the parameter space using example mo...
104
click to vote
COLT
1993
Springer
15 years 3 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
100
click to vote
MP
1998
14 years 11 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...