1067 search results - page 27 / 214 » Probabilistic regular graphs |
110
click to vote
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
COMBINATORICS
2007
15 years 13 days ago
2007
In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let e be an edge of an rregular graph G. If G has...
98
Voted
ML
2010
ACM
14 years 11 months ago
2010
ACM
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as wel...
83
Voted
CPC
2007
15 years 12 days ago
2007
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
110
click to vote
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information net...