Three new versions of the all-ones problem

MaRDI QIDQ5320543zbMATH OpenFDO

Authors Xiaoyan Zhang, Xueliang Li

Publication date 22 July 2009

Full work available at URL https://arxiv.org/abs/math/0512011

zbMATH Keywords

all-ones problemgraph algorithmminimum weightperfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• The Minimum All-Ones Problem for Trees
• The general \(\sigma \) all-ones problem for trees
• 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
• The Minimum All-Ones Problem for Graphs with Small Treewidth

Cited in

(5)

• 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
• The Minimum All-Ones Problem for Trees
• The general \(\sigma \) all-ones problem for trees

This page was built for publication: Three new versions of the all-ones problem

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