370 search results - page 47 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
214
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
213
click to vote
SSD
1993
Springer
15 years 10 months ago
1993
Springer
: Spatial data types or algebras for database systems should (i) be fully general (which means, closed under set operations, hence e.g. a region value can be a set of polygons with...
136
click to vote
IJCAI
2007
15 years 7 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
160
click to vote
GD
2007
Springer
16 years 18 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
169
click to vote
DMGT
2011
14 years 10 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...