483 search results - page 1 / 97 » On perfectness of sums of graphs |
DM
1999
13 years 5 months ago
1999
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
FSTTCS
2009
Springer
14 years 3 days ago
2009
Springer
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
JCT
1998
13 years 5 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...