Parameterized Complexity of Independent Set in H-Free Graphs - Archive ouverte HAL
Article Dans Une Revue Algorithmica Année : 2020

Dates et versions

hal-03015353 , version 1 (10-09-2020)
hal-03015353 , version 2 (19-11-2020)

Identifiants

Citer

Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant. Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica, 2020, 82 (8), pp.2360-2394. ⟨10.1007/s00453-020-00730-6⟩. ⟨hal-03015353v1⟩
157 Consultations
137 Téléchargements

Altmetric

Partager

More