2310 search results - page 163 / 462 » Coloring Random Graphs |
101
click to vote
SIGECOM
2006
ACM
15 years 8 months ago
2006
ACM
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
154
click to vote
JMLR
2008
15 years 2 months ago
2008
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
145
click to vote
CPHYSICS
2011
14 years 6 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
113
click to vote
AICCSA
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...
173
Voted
STACS
2012
Springer
13 years 10 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...