1542 search results - page 93 / 309 » The metamathematics of random graphs |
SIGECOM
2006
ACM
15 years 7 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...
147
click to vote
JMLR
2008
15 years 1 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...
106
click to vote
AICCSA
2005
IEEE
15 years 7 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...
129
click to vote
PVLDB
2010
15 years 4 days ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
135
click to vote
BMVC
2010
14 years 11 months ago
2010
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...