168 search results - page 7 / 34 » Chain Intersecting Families |
COMBINATORICS
2006
13 years 7 months ago
2006
Sommerville [10] and Davies [2] classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. Relaxing this condition yields other triangles, which tile ...
SIAMCO
2002
13 years 7 months ago
2002
The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time, for...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
JGT
2008
13 years 7 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...