Sciweavers

745 search results - page 31 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
COCOA
2008
Springer
15 years 4 months ago
Protean Graphs with a Variety of Ranking Schemes
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
PCI
2005
Springer
15 years 8 months ago
NGCE - Network Graphs for Computer Epidemiologists
Abstract. Graphs are useful data structures capable of efficiently representing a variety of technological and social networks. They are therefore utilized in simulation-based stud...
Vasileios Vlachos, Vassiliki Vouzi, Damianos Chatz...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 3 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
FOCS
2008
IEEE
15 years 9 months ago
k-Wise Independent Random Graphs
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
Noga Alon, Asaf Nussboim
SASN
2004
ACM
15 years 8 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim