374 search results - page 19 / 75 » Stochastic Minority on Graphs |
CAAN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
CSL
2003
Springer
14 years 19 days ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
EACL
1989
ACL Anthology
13 years 8 months ago
1989
ACL Anthology
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenome...
COMBINATORICS
2006
13 years 7 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...