Fixed points in conjunctive networks and maximal independent sets in graph contractions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computer and System Sciences Année : 2017

Fixed points in conjunctive networks and maximal independent sets in graph contractions

Résumé

Given a graph G, viewed as a loop-less symmetric digraph, we study the maximum number of fixed points in a conjunctive boolean network with G as interaction graph. We prove that if G has no induced C 4 , then this quantity equals both the number of maximal independent sets in G and the maximum number of maximal independent sets among all the graphs obtained from G by contracting some edges. We also prove that, in the general case, it is coNP-hard to decide if one of these equalities holds, even if G has a unique induced C 4 .
Fichier principal
Vignette du fichier
2017-04-18_MaxFP_Symmetric_Arxiv_V2.pdf (440.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01630474 , version 1 (07-11-2017)

Identifiants

Citer

Julio Aracena, Adrien Richard, Lilian Salinas. Fixed points in conjunctive networks and maximal independent sets in graph contractions. Journal of Computer and System Sciences, 2017, 88, pp.145-163. ⟨10.1016/j.jcss.2017.03.016⟩. ⟨hal-01630474⟩
84 Consultations
92 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More