330 search results - page 35 / 66 » Compressing Bounded Degree Graphs |
115
Voted
IM
2008
15 years 2 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...
112
Voted
RSA
2011
14 years 9 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
128
Voted
NETWORKING
2007
15 years 4 months ago
2007
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
121
Voted
SIROCCO
2004
15 years 3 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
131
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...