On the NP-completeness of the perfect matching free subgraph problem

However, from the complexity point of view, better results can be obtained for structural restricted Petri nets: for example, the complexity of the reachability problem boils down

Optimal constrained matching problem (see [3, 20]), which is a variant from the optimal matching problem and the partial transport problem (see for instance [14, 18]), consists

In this section we suppose that all the concerned indices are good, and reduce the study of our minimizer (u, W) near a point (say, the origin) to the study of minor variants of

Russell used acquaintance to that effect: ÒI say that I am acquainted with an object when I have a direct cognitive relation to that object, that is when I am directly aware of

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rh ˆone-Alpes, 46 avenue F´elix Viallet, 38031 GRENOBLE Cedex

We would like to point out that the Compact Table of order ℓ problem with a limited number of possible results becomes trivial (solvable in constant time), because with a limited

The complexity of the Approximate Multiple Pattern Matching Problem for random strings... Pattern Matching Problem for

Higher order connected link averages could be included in (19) as well, but in this paper we shall only consider the effect of triangular correlations in order to keep