2310 search results - page 113 / 462 » Coloring Random Graphs |
119
click to vote
EJC
2008
15 years 2 months ago
2008
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...
162
Voted
COMBINATORICS
2002
15 years 2 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
140
click to vote
COCOA
2008
Springer
15 years 4 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...
142
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...
100
click to vote
CORR
2010
Springer
15 years 2 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...