592 search results - page 18 / 119 » Crossing numbers of random graphs |
WEA
2005
Springer
14 years 1 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
COMBINATORICA
2008
13 years 6 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
ANOR
2005
13 years 7 months ago
2005
This paper addresses the problem of loading a finite capacity, stochastic (random) and dynamic multi-project system. The system is controlled by keeping a constant number of projec...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
COMBINATORICA
2008
13 years 8 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...