374 search results - page 1 / 75 » Stochastic Minority on Graphs |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Cellular automata have been mainly studied for on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneo...
ENDM
2008
13 years 5 months ago
2008
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
COMBINATORICA
2008
13 years 5 months ago
2008
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...