401 search results - page 17 / 81 » Sparse Quasi-Random Graphs |
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
JCT
2006
13 years 7 months ago
2006
One of Erdos' favourite conjectures was that any triangle-free graph G on n vertices should contain a set of n/2 vertices that spans at most n2/50 edges. We prove this when t...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...