Complexity of the unicity of an optimal vertex cover in graphs

Olivier Hudry; Antoine Lobstein

Conference papers

Complexity of the unicity of an optimal vertex cover in graphs

Olivier Hudry ^{1, 2, 3} Antoine Lobstein ⁴

1 Télécom Paris

2 C2 - Cybersécurité et Cryptographie

LTCI - Laboratoire Traitement et Communication de l'Information : 484335

3 INFRES - Département Informatique et Réseaux

4 LRI - Laboratoire de Recherche en Informatique

Document type :

Conference papers

Domain :

Computer Science [cs] / Discrete Mathematics [cs.DM]

Computer Science [cs] / Computational Complexity [cs.CC]

Complete list of metadata

https://hal.telecom-paris.fr/hal-03714746
Contributor : Olivier Hudry Connect in order to contact the contributor
Submitted on : Tuesday, July 5, 2022 - 7:59:18 PM
Last modification on : Friday, July 8, 2022 - 4:15:28 AM

Complexity of the unicity of an optimal vertex cover in graphs

Identifiers

Collections

Citation

Export

Metrics

0

Complexity of the unicity of an optimal vertex cover in graphs

Identifiers

Collections

Citation

Export

Share

Metrics

0