335 search results - page 3 / 67 » Resolvent of large random graphs |
RSA
2006
13 years 7 months ago
2006
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
SMA
1999
ACM
13 years 12 months ago
1999
ACM
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
CN
2007
13 years 7 months ago
2007
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
PVLDB
2010
13 years 6 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...