Sciweavers

1949 search results - page 19 / 390
» Random graphs on surfaces
Sort
View
CVPR
2000
IEEE
15 years 5 months ago
Geodesic Distance Evolution of Surfaces: A New Method for Matching Surfaces
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...
Hussein M. Yahia, Etienne G. Huot, Isabelle Herlin...
116
Voted
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
15 years 14 days ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
74
Voted
TCC
2005
Springer
101views Cryptology» more  TCC 2005»
15 years 6 months ago
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs
Moni Naor, Asaf Nussboim, Eran Tromer
53
Voted
FOCS
2000
IEEE
15 years 5 months ago
Random graph models for the web graph
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala...