A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...