5606 search results - page 128 / 1122 » Randomization Techniques for Graphs. |
CORR
2010
Springer
15 years 22 days ago
2010
Springer
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
107
Voted
FCT
2009
Springer
15 years 7 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di�...
103
Voted
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
96
Voted
GRAPHICSINTERFACE
2009
14 years 10 months ago
2009
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
82
Voted
IM
2007
15 years 17 days ago
2007
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...