598 search results - page 22 / 120 » A random graph model for massive graphs |
ICPR
2002
IEEE
15 years 16 hour ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
SPAA
2009
ACM
14 years 11 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
CIKM
2008
Springer
14 years 28 days ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...