Sciweavers

1949 search results - page 5 / 390
» Random graphs on surfaces
Sort
View
RSA
2010
108views more  RSA 2010»
13 years 5 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
MICCAI
2010
Springer
13 years 5 months ago
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
Moti Freiman, A. Kronman, S. J. Esses, Leo Joskowi...
JCT
2007
142views more  JCT 2007»
13 years 6 months ago
Graphs that triangulate a given surface and quadrangulate another surface
We show that for any closed surface F with χ(F) −4 (or χ(F) −2), there exist graphs that triangulate the torus or the Klein bottle (or the projective plane) and that quadran...
Yusuke Suzuki
CORR
2002
Springer
135views Education» more  CORR 2002»
13 years 7 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
András A. Benczúr, David R. Karger
LATIN
2000
Springer
13 years 11 months ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito