43 search results - page 6 / 9 » Random graphs with forbidden vertex degrees |
147
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
157
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
149
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
172
click to vote
DM
2011
15 years 16 days ago
2011
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...
140
click to vote
AINA
2010
IEEE
15 years 10 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...