723 search results - page 21 / 145 » On the hyperbolicity constant in graphs |
142
click to vote
STOC
2001
ACM
16 years 6 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...
211
click to vote
CVPR
2000
IEEE
15 years 10 months ago
2000
IEEE
The general problem of surface matching is taken up in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in t...
192
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
156
click to vote
ISCAS
2005
IEEE
15 years 11 months ago
2005
IEEE
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
141
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...