CPC
2010
13 years 2 months ago
2010
CPC
2010
13 years 2 months ago
2010
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
CPC
2010
13 years 2 months ago
2010
CPC
2010
13 years 5 months ago
2010
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
CPC
2010
13 years 5 months ago
2010
We investigate the end spaces of infinite dual graphs. We show that there exists a natural homeomorphism between the end spaces of a graph and its dual, and that this homeomorphis...
CPC
2010
13 years 5 months ago
2010
CPC
2010
13 years 5 months ago
2010
Define the Linus sequence Ln for n 1 as a 0-1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln-2r+1 . . . Ln-r = Ln-r...
CPC
2010
13 years 5 months ago
2010