1591 search results - page 36 / 319 » Random lifts of graphs |
169
click to vote
COCOA
2008
Springer
15 years 7 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...
179
click to vote
ICDM
2007
IEEE
15 years 11 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...
126
click to vote
CORR
2010
Springer
15 years 5 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...
190
click to vote
MST
2006
15 years 5 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
150
click to vote
CCCG
2009
15 years 6 months ago
2009
We study the emergence of rigid components in an Erdos-R