483 search results - page 63 / 97 » On perfectness of sums of graphs |
COMBINATORICA
2004
14 years 10 months ago
2004
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
110
click to vote
SAGT
2010
Springer
14 years 9 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
STACS
2009
Springer
15 years 5 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
SPAA
2005
ACM
15 years 4 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...