251 search results - page 1 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
COCOON
2001
Springer
14 years 3 months ago
2001
Springer
LICS
2010
IEEE
13 years 8 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
IJCGA
2002
13 years 10 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
IPL
2002
13 years 10 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...