374 search results - page 29 / 75 » Stochastic Minority on Graphs |
100
click to vote
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
SIAMCO
2008
14 years 9 months ago
2008
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLC...
CDC
2010
IEEE
14 years 5 months ago
2010
IEEE
Existing work on programmable self assembly has focused on deterministic performance guarantees--stability of desirable states. In particular, for any acyclic target graph a binary...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...