5606 search results - page 62 / 1122 » Randomization Techniques for Graphs. |
CORR
2011
Springer
13 years 4 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...
IJCAI
2001
13 years 10 months ago
2001
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
FCT
2009
Springer
14 years 3 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
