1542 search results - page 226 / 309 » The metamathematics of random graphs |
CACM
2008
15 years 1 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
119
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
133
click to vote
TCOM
2008
15 years 1 months ago
2008
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
142
Voted
SIAMJO
2002
15 years 1 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
111
click to vote
WWW
2011
ACM
14 years 8 months ago
2011
ACM
Social hierarchy and stratification among humans is a well studied concept in sociology. The popularity of online social networks presents an opportunity to study social hierarch...