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

(1, 2, 3) , (4)
1
2
3
4
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⟩
26 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More