359 search results - page 3 / 72 » Online Algorithms for Disk Graphs |
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
CCCG
2008
13 years 7 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
SEMWEB
2009
Springer
13 years 10 months ago
2009
Springer
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
CCCG
2010
13 years 7 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 ...
WG
2005
Springer
13 years 11 months ago
2005
Springer