• Aucun résultat trouvé

On the complexity of some subgraph problems

N/A
N/A
Protected

Academic year: 2022

Partager "On the complexity of some subgraph problems"

Copied!
9
0
0

Texte intégral

Références

Documents relatifs

McGregor [8] proposes a different approach based on Branch & Bound: Each node of the search tree corresponds to the matching of two components, and a bounding function evaluates

Der „Vertrag zwischen Österreich und der Bundesrepublik Deutschland zur Ordnung vermögensrechtlicher Beziehungen“ (Vermögensvertrag) gliedert sich in sechs Teile: Teil eins regelte

L’échographie rénale n’est pas dispensable pour la confirmation du diagnostic mais surtout nécessaire pour voire le retentissement de cette intoxication sur cet

The next multicolumns exhibit the results obtained on instances 1.8 and 3.5: “P rimal best ” presents the average value of the best integer solution found in the search tree; “Gap

Immediately, the phase detector of the inner control loop produces a large differ- ential current error signal, indicating that the two CML buffers are not

Only, in this case, the critical, power-law distribution possesses a sufficiently heavy tail such that the mass of the largest cluster scales as the total mass, providing

The extracted concepts obtained in several rankings of concepts are combined together into a single pool of unique concepts for each document using eight voting techniques (described

This study examines marital and parental status in relation to perceptions of the quality of work and family roles (psychological well-being, job satisfaction, work involvement,