2079 search results - page 51 / 416 » Universality of random graphs |
136
click to vote
FCT
2009
Springer
15 years 10 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, ...
119
click to vote
APPROX
2009
Springer
15 years 10 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...
130
Voted
CPC
2006
15 years 4 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 ...
148
click to vote
CICLING
2011
Springer
14 years 7 months ago
2011
Springer
In recent years, extraction of temporal relations for events that express sentiments has drawn great attention of the Natural Language Processing (NLP) research communities. In thi...