646 search results - page 22 / 130 » Generalized connected domination in graphs |
127
click to vote
EJC
2011
14 years 6 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
CIE
2007
Springer
15 years 6 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
127
click to vote
CVPR
2003
IEEE
15 years 5 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
111
click to vote
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
Because of irreversibility of movements, motion planning on directed graphs is much more intricate than that on graphs. Recently we showed that the feasibility of motion planning o...