598 search results - page 71 / 120 » A random graph model for massive graphs |
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
WAW
2004
Springer
15 years 5 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
COMSWARE
2007
IEEE
15 years 6 months ago
2007
IEEE
— Recent studies on wireless sensor networks (WSN) have shown that the duration of contacts and inter-contacts are power law distributed. While this is a strong property of these...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
105
click to vote
COMPLEX
2009
Springer
15 years 3 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...