61 search results - page 3 / 13 » A chain theorem for matroids |
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...
DM
2006
13 years 7 months ago
2006
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
ORDER
2011
13 years 2 months ago
2011
We prove a Hadwiger transversal type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the ord...
PSSS
2003
13 years 8 months ago
2003
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...