947 search results - page 91 / 190 » Discrete Geometry |
127
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
We study (vertex-disjoint) packings of paths of length two (i.e., of P2's) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use e...
167
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
130
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
106
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
Given a fixed origin o in the d-dimensional grid, we give a novel definition of digital rays dig(op) from o to each grid point p. Each digital ray dig(op) approximates the Euclide...
117
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
Anisotropic meshes are triangulations of a given domain in the plane or in higher dimensions, with elements elongated along prescribed directions. Anisotropic triangulations have ...