We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
For every n, we construct two arcs in the four-punctured sphere that have at least n intersections and which do not form spirals. This is accomplished in several steps: we first ...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...