Title of article
Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
Author/Authors
Chen، نويسنده , , William Y.C. and Li، نويسنده , , Xueliang and Wang، نويسنده , , Chao and Zhang، نويسنده , , Xiaoyan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
6
From page
93
To page
98
Abstract
In this paper, we give graph-theoretic algorithms of linear time to the Minimum All-Ones Problem for unicyclic and bicyclic graphs. These algorithms are based on a graph-theoretic algorithm of linear time to the Minimum All-Ones Problem with Restrictions for trees.
Keywords
linear time , graph-theoretic algorithm , (Minimum) All-Ones Problem
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2004
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453680
Link To Document