1332 search results - page 103 / 267 » Combinatorial Algorithms |
COCOA
2008
Springer
13 years 11 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...
MVA
2007
13 years 10 months ago
2007
In many applications, it is necessary to extract corresponding points automatically. In this study, we present a method of extracting corresponding points automatically from stere...
GD
2008
Springer
13 years 10 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
CSUR
2000
13 years 9 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...