1511 search results - page 17 / 303 » Randomness, lowness and degrees |
102
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
DEBS
2007
ACM
15 years 3 months ago
2007
ACM
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
CPC
2006
14 years 11 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
131
click to vote
PROPERTYTESTING
2010
14 years 9 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
COMBINATORICS
2006
14 years 11 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...