Complexity of the computation of dominating sets in graphs - Télécom Paris
Communication Dans Un Congrès Année : 2018

Complexity of the computation of dominating sets in graphs

Fichier non déposé

Dates et versions

hal-04283510 , version 1 (13-11-2023)

Identifiants

  • HAL Id : hal-04283510 , version 1

Citer

Olivier Hudry. Complexity of the computation of dominating sets in graphs. EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization, 2018, Bologne, Italy. ⟨hal-04283510⟩
34 Consultations
0 Téléchargements

Partager

More