1542 search results - page 113 / 309 » The metamathematics of random graphs |
109
click to vote
IM
2008
15 years 1 months ago
2008
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
119
Voted
WWW
2004
ACM
16 years 2 months ago
2004
ACM
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
139
click to vote
IEICET
2010
14 years 11 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
96
Voted
JGT
2007
15 years 1 months ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
120
Voted
EJC
2006
15 years 1 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...