174 search results - page 13 / 35 » Connected dominating sets on dynamic geometric graphs |
145
click to vote
ICMCS
2007
IEEE
16 years 10 days ago
2007
IEEE
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
173
click to vote
ICPP
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
176
click to vote
IPPS
2009
IEEE
16 years 20 days ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
144
click to vote
COCOON
2009
Springer
16 years 18 days ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...