2310 search results - page 116 / 462 » Coloring Random Graphs |
116
click to vote
CORR
2010
Springer
15 years 2 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...
117
Voted
FCT
2009
Springer
15 years 9 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, ...
95
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
106
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
114
click to vote
CPC
2006
15 years 2 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...