174 search results - page 21 / 35 » Connected dominating sets on dynamic geometric graphs |
158
click to vote
SIROCCO
2000
15 years 7 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
189
click to vote
EJC
2011
15 years 1 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
172
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
170
click to vote
IWPEC
2009
Springer
16 years 17 days ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
163
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...