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

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.

Mots clés

Synchrophasor Power Edge Set Zero Forcing Set Complexity

Domaines

Complexité [cs.CC] Algorithme et structure de données [cs.DS]

Fichier principal

main.pdf (477.77 Ko)

Origine	Fichiers produits par l'(les) auteur(s)
Licence	Paternité

Mathias Weller : Connectez-vous pour contacter le contributeur

https://hal.science/hal-02359076

Soumis le : dimanche 9 juin 2024-21:10:45

Dernière modification le : jeudi 19 décembre 2024-16:50:03

Dates et versions

hal-02359076 , version 1 (09-06-2024)

Licence

Paternité

Identifiants

HAL Id : hal-02359076 , version 1
DOI : 10.1007/978-3-030-25005-8_11

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

ENPC CNRS UNIV-DAUPHINE INSMI PARISTECH LIGM LIGM_MOA MAB MAORE LIRMM LAMSADE-DAUPHINE PSL MIPS UNIV-MONTPELLIER ESIEE-PARIS UNIV-EIFFEL LIGM_ADA

226 Consultations

37 Téléchargements