(1)MAXIMUM EDGE DISJOINT PATHS AND MINIMUM UNWEIGHTED MULTICUT PROBLEMS IN GRID GRAPHS C

In Section 5 we consider the parameterized complexity of the bounded length version of MaxCDDP, for the combined parameter number of vertex and color-disjoint paths of a solution

On peut expliquer cette différence de plusieurs manières : la méthode de calibration du test que j’ai employé est différente de celle utilisée par Mr DODELE, les testeurs

Subsection 5.3 gives a complete description of the convex hull of incidence vectors of stable sets, for the particular case of sets of cardinality 2... These arcs must be such that

7 Dynamic viscosity at 80 °C as a function of logarithmic angular frequency for neat epoxy resin and for CNT-modified resin loaded at 0.5, 1, and 2 mass% of MWCNT... network:

Cet article sur la place des familles et le rôle des associations de parents d’enfants autistes aux États-Unis et en France vise à mieux comprendre

An early memory is a statement of something that happened once, a specific incident, such as "I recall once when my brothers and I were at the beach " (Mosak, 1958, p.

We show that the decision versions of the minimum cover and partition by γ-quasi-cliques problems are NP-complete for any fixed γ satisfying 0 < γ < 1.. Key-words:

overall population discussed above in order to draw out more specifics about the business, the impressions from business owners regarding their current business and the changes