The minimum all-ones problem is applied in linear cellular automata. It is NP-complete for general graphs. In this paper, we consider the problem for graphs with small treewidth≤4. We give an 0(|V|) algorithm. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Lu, Y., & Li, Y. (2007). The minimum all-ones problem for graphs with small treewidth. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 335–342). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_35
Mendeley helps you to discover research relevant for your work.