Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-completeReportar como inadecuado




Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 Department of Computing Science Edmonton

Abstract : A graph is unfrozen with respect to k independent set if it has an independent set of size k after the addition of any edge. The problem of recognizing such graphs is known to be NP-complete. A graph is maximal if the addition of one edge means it is no longer unfrozen. We designate the problem of recognizing maximal unfrozen graphs as MAXUk-SET and show that this problem is CO-NP-complete. This partially fills a gap in known complexity cases of maximal NP-complete problems, and raises some interesting open conjectures discussed in the conclusion.

Mots-clés : extremal unfrozen graph independent set co-NP-complete





Autor: Nesrine Abbas - Joseph Culberson - Lorna Stewart -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados