On the Complexity and Inapproximability of Dissociation Set Problems in Graphs

Y. Orlovich Alexandre Dolgui 1 Gerd Finke 2 Valery Gordon Frank Werner 3
1 Laboratoire en Sciences et Technologies de l'Information
Division for Indl Engineering and Computer Sciences
2 G-SCOP_ROSP - ROSP
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
Document type :
Reports
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00617117
Contributor : Nadia Brauner <>
Submitted on : Friday, August 26, 2011 - 10:49:25 AM
Last modification on : Monday, April 8, 2019 - 10:29:30 AM

Identifiers

  • HAL Id : hal-00617117, version 1

Citation

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〉

Share

Metrics

Record views

193