Computer Science ›› 2018, Vol. 45 ›› Issue (4): 8388.doi: 10.11896/j.issn.1002137X.2018.04.012
Previous Articles Next Articles
ZHANG Jianan and XIAO Mingyu
[1] ALAVI Y,BEHZAD M,LESNIAKFOSTER L M,et al.Total matchings and total coverings of graphs[J].Journal of Graph Theory,1977,1(2):135140. [2] LAN J K,CHANG G J.On the mixed domination problem in graphs [J].Theoretical Computer Science,2013,476(476):8493. [3] MANLOVE D F.On the algorithmic complexity of twelve covering and independence parameters of graphs[J].Discrete Applied Mathematics,1999,91(13):155175. [4] ALAVI Y,LIU J,WANG J,et al.On total covers of graphs[J].Discrete Mathematics,1992,100(13):229233. [5] ZHAO Y,KANG L,SOHN M Y.The algorithmic complexity of mixed domination in graphs [J].Theoretical Computer Science,2011,412(22):23872392. [6] GAREY M R,JOHNSON D S.Computers and Intractability:A Guide to the Theory of NPCompleteness[M].W.H.Freeman and Company,1979. [7] BERTOSSI A A.Dominating sets for split and bipartite graphs[J].Information Processing Letters,1984,19(1):3740. [8] PAPADIMITRIOU C H,STEIGLITZ K.Combinatorial optimization:algorithms and complexity[M].Prentice Hall,1998. [9] JOHNSON D S.Approximation algorithms for combinatorialproblems[J].Journal of Computer and System Sciences,1982,9(3):256278. [10] FUJITO T,NAGAMOCHI H.A 2approximation algorithm for the minimum weight edge dominating set problem [J].Discrete Applied Mathematics,2002,118(3):199207. [11] NEMHAUSER G L,JR L E Trotter.Properties of vertex packing and independence system polyhedra[J].Mathematical Programming,1974,6(1):4861. [12] YANNAKAKIS M,GAVRIL F.Edge Dominating Sets inGraphs[J].SIAM Journal on Applied Mathematics,1980,38(3):364372. [13] NIEBERG T,HURINK J.A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs[M]∥Approximation and Online Algorithms.Springer Berlin Heidelberg,2005:296306. [14] HEDETNIEMI S T,LASKAR R C.Bibliography on domination in graphs and some basic definitions of domination parameters[J].Discrete Mathematics,1991,86(1):257277. [15] XIAO M,KLOKS T,POON S H.New parameterized algorithms for edge dominating set[J].Theoretical Computer Science,2013,4(511):147158. [16] HATAMI P.An approximation algorithm for the total covering problem[J].Discussiones Mathematicae Graph Theory,2007,27(3):553558. [17] RAZ R,SAFRA S.A subconstant errorprobability lowdegree test,and a subconstant errorprobability PCP characterization of NP[C]∥Proceedings of TwentyNinth ACM Symposium on Theory of Computing(STOC).ACM,1997:475484. 
No related articles found! 
