725 search results - page 74 / 145 » Bounding Degrees on RPL |
NETWORKING
2007
13 years 11 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...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
COMGEO
2010
ACM
13 years 10 months ago
2010
ACM
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
COMBINATORICS
2006
13 years 10 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
IM
2008
13 years 10 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...