48 search results - page 4 / 10 » Distribution of Vertex Degree in Web-Graphs |
145
click to vote
PODC
2010
ACM
15 years 8 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...
157
click to vote
SIAMDM
2010
15 years 2 months ago
2010
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
141
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
131
click to vote
DM
2008
15 years 4 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
185
Voted
KDD
2012
ACM
13 years 7 months ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...