1542 search results - page 61 / 309 » The metamathematics of random graphs |
135
click to vote
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
135
click to vote
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
107
click to vote
CCCG
2009
15 years 2 months ago
2009
We study the emergence of rigid components in an Erdos-R
107
click to vote
RSA
2006
15 years 1 months ago
2006
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...