374 search results - page 2 / 75 » Stochastic Minority on Graphs |
GC
2007
Springer
13 years 6 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
ACRI
2008
Springer
13 years 8 months ago
2008
Springer
Cellular automata are usually updated synchronously and thus deterministically. The question of stochastic dynamics arises in the development of cellular automata resistant to nois...
ESA
2010
Springer
13 years 7 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
MFCS
2007
Springer
14 years 15 days ago
2007
Springer
ALGORITHMICA
2004
13 years 6 months ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...