265 search results - page 5 / 53 » Generating an Assortative Network with a Given Degree Distri... |
DIALM
2003
ACM
14 years 1 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
CCR
2002
13 years 8 months ago
2002
It has long been thought that the Internet, and its constituent networks, are hierarchical in nature. Consequently, the network topology generators most widely used by the Interne...
BMCBI
2004
13 years 8 months ago
2004
Background: Recent genomic and bioinformatic advances have motivated the development of numerous network models intending to describe graphs of biological, technological, and soci...
IPPS
1998
IEEE
14 years 24 days ago
1998
IEEE
The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating highly reliable distributed systems by leveraging commercially available personal compute...