On the Complexity and Inapproximability of Dissociation Set Problems in Graphs - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2010

On the Complexity and Inapproximability of Dissociation Set Problems in Graphs

Y. Orlovich
  • Function : Author
Valery Gordon
  • Function : Author
Frank Werner
  • Function : Author
  • PersonId : 893489
No file

Dates and versions

hal-00617117 , version 1 (26-08-2011)

Identifiers

  • HAL Id : hal-00617117 , version 1

Cite

Y. Orlovich, Alexandre Dolgui, Gerd Finke, Valery Gordon, Frank Werner. On the Complexity and Inapproximability of Dissociation Set Problems in Graphs. [Research Report] --. 2010. ⟨hal-00617117⟩
130 View
0 Download

Share

Gmail Facebook X LinkedIn More