330 search results - page 23 / 66 » Compressing Bounded Degree Graphs |
142
click to vote
NETWORKS
2008
15 years 3 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
125
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
54
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We show that for every connected graph G of diameter 3, the graph G3 has average degree 7 4 (G). We also provide an example showing that this bound is best possible. This resolv...
114
click to vote
SIAMDM
2010
14 years 10 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
150
click to vote
IMC
2010
ACM
15 years 1 months ago
2010
ACM
The Internet topology data collected through traceroute exploration has been extensively studied in the past. In particular, a remarkable property of the Internet, the power-law s...