Graph matching problems and the NP-hardness of sortedness constraints - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2017

Graph matching problems and the NP-hardness of sortedness constraints

Irena Rusu

Dates et versions

hal-01708356 , version 1 (13-02-2018)

Identifiants

Citer

Irena Rusu. Graph matching problems and the NP-hardness of sortedness constraints. Theoretical Computer Science, 2017, 695, pp.16 - 27. ⟨10.1016/j.tcs.2017.07.019⟩. ⟨hal-01708356⟩
67 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More