101 search results - page 1 / 21 » Domination Problems in Nowhere-Dense Classes |
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
ACCV
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The importance of spatial configuration information for object class recognition is widely recognized. Single isolated local appearance codes are often ambiguous. On the...
AAAI
2012
11 years 7 months ago
2012
In AI research, mechanism design is typically used to allocate tasks and resources to agents holding private information about their values for possible allocations. In this conte...
SSPR
2010
Springer
13 years 3 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...