A Note on Irreversible 2-Conversion Sets in Subcubic Graphs
暂无分享,去创建一个
[1] Jonathan L. Gross,et al. Finding a maximum-genus graph imbedding , 1988, JACM.
[2] Matthias F. Stallmann,et al. Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) , 1985, ICALP.
[3] J. Kynčl,et al. Irreversible 2-conversion set is NP-complete , 2009 .
[4] Harold N. Gabow,et al. Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract) , 1985 .
[5] Fred S. Roberts,et al. Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion , 2009, Discret. Appl. Math..
[6] François Le Gall,et al. Powers of tensors and fast matrix multiplication , 2014, ISSAC.
[7] Harold N. Gabow,et al. An augmenting path algorithm for linear matroid parity , 1986, Comb..
[8] Yoji Kajitani,et al. On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three , 1988, Discret. Math..
[9] Jayme Luiz Szwarcfiter,et al. Irreversible conversion of graphs , 2011, Theor. Comput. Sci..
[10] Jan Kyncl,et al. Irreversible 2-conversion set in graphs of bounded degree , 2017, Discret. Math. Theor. Comput. Sci..
[11] Asahi Takaoka,et al. On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs , 2013, IEICE Trans. Inf. Syst..
[12] Jianer Chen,et al. On Feedback Vertex Set: New Measure and New Structures , 2010, Algorithmica.
[13] Sarah Spence Adams,et al. Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products , 2013, Australas. J Comb..