332 search results - page 27 / 67 » Parameterized Graph Separation Problems |
IAT
2005
IEEE
15 years 5 months ago
2005
IEEE
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
104
click to vote
SCALESPACE
2007
Springer
15 years 5 months ago
2007
Springer
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variation...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type ZZ T {f0} 12 dx dy for quadratic p...
117
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...