174 search results - page 17 / 35 » Connected dominating sets on dynamic geometric graphs |
197
click to vote
COCOA
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
191
click to vote
COMPGEOM
2006
ACM
16 years 11 hour ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
169
click to vote
DASFAA
2010
IEEE
15 years 11 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
176
click to vote
FOCS
2006
IEEE
16 years 2 days ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
231
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...