374 search results - page 25 / 75 » Stochastic Minority on Graphs |
100
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
CORR
2010
Springer
15 years 23 days ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
112
Voted
ICALP
2009
Springer
16 years 29 days ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
95
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for shape matching and object recognition. However, it is well known that skeletal ...
104
Voted
EJC
2008
15 years 22 days ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...