Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02359076
Contributor : Mathias Weller <>
Submitted on : Tuesday, November 12, 2019 - 11:56:00 AM
Last modification on : Thursday, October 29, 2020 - 11:22:11 AM

Licence


Copyright

Identifiers

Citation

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

Share

Metrics

Record views

108