1511 search results - page 64 / 303 » Randomness, lowness and degrees |
SAINT
2007
IEEE
15 years 6 months ago
2007
IEEE
In recent years, it has been reported that several existing networks including the Internet have scale-free structure. In this paper, through a simple numerical analysis, we inves...
IM
2008
14 years 12 months ago
2008
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
111
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
DAC
2000
ACM
16 years 25 days ago
2000
ACM
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...