Complexity of the unicity of an optimal vertex cover in graphs - Archive ouverte HAL Access content directly
Conference Papers Year :

Complexity of the unicity of an optimal vertex cover in graphs

Domains

Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Computational Complexity [cs.CC]

Olivier Hudry  : Connect in order to contact the contributor

https://hal.telecom-paris.fr/hal-03714746

Submitted on : Tuesday, July 5, 2022-7:59:18 PM

Last modification on : Friday, March 24, 2023-2:53:27 PM

Not file

Dates and versions

hal-03714746 , version 1 (05-07-2022)

Identifiers

  • HAL Id : hal-03714746 , version 1

Cite

Olivier Hudry, Antoine Lobstein. Complexity of the unicity of an optimal vertex cover in graphs. Stockholm Optimization Days 2022, Jun 2022, Stockholm, Sweden. ⟨hal-03714746⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

INSTITUT-TELECOM CNRS UMR8623 CENTRALESUPELEC TDS-MACS UNIV-PARIS-SACLAY LTCI INFRES IP_PARIS GS-COMPUTER-SCIENCE GS-LIFE-SCIENCES-HEALTH C2
32 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More