3008 search results - page 174 / 602 » Independence in connected graphs |
196
click to vote
CCCG
2010
15 years 8 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
175
click to vote
NETWORKING
2007
15 years 8 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...
167
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
172
click to vote
CN
2007
15 years 6 months ago
2007
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
204
click to vote
WADS
2007
Springer
16 years 19 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...