The Minimum All-Ones Problem for Graphs with Small Treewidth

DOI10.1007/978-3-540-73556-4_35MaRDI QIDQ3611986zbMATH OpenOpenAlexFDO

Authors Yunting Lu, Yueping Li

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_35

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Cellular automata (computational aspects) (68Q80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The Minimum All-Ones Problem for Trees
• Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
• On the complexity of dominating set problems related to the minimum all-ones problem
• The general \(\sigma \) all-ones problem for trees
• Minimum size tree-decompositions

Cited in

(9)

• Solutions to all-colors problem on graph cellular automata
• On the complexity of dominating set problems related to the minimum all-ones problem
• Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
• scientific article; zbMATH DE number 165095 (Why is no real title available?)
• The Minimum All-Ones Problem for Trees
• Three new versions of the all-ones problem
• A parameterized perspective of \textsc{all-colors}
• A parameterized perspective of \textsc{All-Colors}
• The general \(\sigma \) all-ones problem for trees

This page was built for publication: The Minimum All-Ones Problem for Graphs with Small Treewidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611986)