Skip to main content
Conference Proceedings

Power edge set and zero forcing set remain difficult in cubic graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11638 LNCS 122-135
DOI: 10.1007/978-3-030-25005-8_11
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Cazals, P., Darties, B., Chateau, A., Giroudeau, R., & Weller, M. (2019). Power edge set and zero forcing set remain difficult in cubic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11638 LNCS, pp. 122–135). Springer Verlag. https://doi.org/10.1007/978-3-030-25005-8_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free