The minimum all-ones problem for graphs with small treewidth

Authors:
Yunting Lu;Yueping Li
Affiliations:
Shenzhen Institute of Information Technology, Shenzhen, P.R. China and SunYat-sen University, Guangzhou, P.R. China;SunYat-sen University, Guangzhou, P.R. China
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 7
Cited 0

The &sgr;-game and cellular automata

American Mathematical Monthly
σ-game, σ+-game and two-dimensional additive cellular automata

Theoretical Computer Science
On Linear Recognition of Tree-Width at Most Four

SIAM Journal on Discrete Mathematics
&sgr;-Automata and Chebyshev-polynomials

Theoretical Computer Science
Universal configurations in light-flipping games

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Minimum All-Ones Problem for Trees

SIAM Journal on Computing
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 O(|V|) algorithm.