592 search results - page 44 / 119 » Crossing numbers of random graphs |
ICTAI
2010
IEEE
13 years 5 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
ML
2010
ACM
13 years 6 months ago
2010
ACM
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...