617 search results - page 53 / 124 » On the Chromatic Number of Random Graphs |
117
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
125
click to vote
CPC
2006
15 years 4 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...
175
click to vote
PROPERTYTESTING
2010
15 years 2 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...
158
click to vote
HT
2010
ACM
15 years 6 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
151
click to vote
WDAG
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...