1806 search results - page 121 / 362 » Randomness and halting probabilities |
IPL
1998
13 years 9 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
ICDCS
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Nowadays companies increasingly aggregate location data from different sources on the Internet to offer locationbased services such as estimating current road traffic c...
SPAA
2009
ACM
14 years 10 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...