483 search results - page 69 / 97 » On perfectness of sums of graphs |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
DISOPT
2010
13 years 8 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
DAM
2002
13 years 8 months ago
2002
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
DAM
2002
13 years 8 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
: Much of the current theory of networked control systems uses simple point-to-point communiodels as an abstraction of the underlying network. As a result, the controller has very ...