Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs

Résumé

This paper presents new complexity and non-approximation results concerning two color propagation problems, namely Power Edge Set and Zero Forcing Set. We focus on cubic graphs, exploiting their structural properties to improve and refine previous results. We also give hardness results for parameterized precolored versions of these problems, and a polynomial-time algorithm for Zero Forcing Set in proper interval graphs.
Fichier non déposé

Dates et versions

hal-02359076 , version 1 (12-11-2019)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Pierre Cazals, Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. IWOCA 2019 - 30th International Workshop on Combinatorial Algorithms, Jul 2019, Pisa, Italy. pp.122-135, ⟨10.1007/978-3-030-25005-8_11⟩. ⟨hal-02359076⟩
100 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More