Computer Science ›› 2020, Vol. 47 ›› Issue (11A): 444448.doi: 10.11896/jsjkx.200300023
• Big Data & Data Science • Previous Articles Next Articles
WANG Hong, GUANG Lihe
CLC Number:
[1] PAREKH A K.Analysis of a greedy heuristic for finding smalldominating sets in graphs [J].Information Processing Letters,1991,39(5):237240. [2] SHEN C,LI T.Multidocument summarization via the minimumdominating set [C]//Proceedings of the 23rd International Conference on Computational Linguistics.Association for Computational Linguistics,Stroudsburg,PA,USA,2010:984992. [3] DINH T N,SHEN Y,NGUYEN D T,et al.On the approximability of positive influence dominating set in social networks [J].Journal of Combinatorial Optimization,2014,27(3):487503. [4] BORIA N,MURAT C,PASCHOS V T.The probabilistic minimum dominating set problem [J].Discrete Applied Mathematics,2018,234:93113. [5] CHINNASAMY A,SIVAKUMAR B,SURESH A,et al.Minimum connected dominating set based RSU allocation for smartCloud vehicles in VANET [J].Cluster Computing,2019,22:S12795S12804. [6] HANAKA T,NISHIMURA N,ONO H.On directed coveringand domination problems [J].Discrete Applied Mathematics,2019,259:7699. [7] LU G,ZHOU M T,TANG Y,et al.A survey on exact algorithms for dominating set related problems in arbitrary graphs [J].Chinese Journal of Computer,2010,33(6):121135. [8] LIN M C,MIZRAHI M J,SZWARCFITER J L.Exact algorithms for minimum weighted dominating induced matching [J].Algorithmica,2017,77(3):642660. [9] ZHOU X Q,YE A S,ZHANG Z Q.Exact algorithm for connected dominating set in undirected graphs [J].Application Research of Computers,2019,36(9):25692574. [10] LIN G,ZHU W X,ALI M M.An effective hybrid memetic algorithm for the minimum weight dominating set problem [J].IEEE Transactions on Evolutionary Computation,2016,20(6):892907. [11] ABED S A,RAIS H M.Hybrid bat algorithm for minimumdominating set problem [J].Journal of Intelligent and Fuzzy Systems,2017,33(4):23292339. [12] YUAN F Y,LI C X,GAO X,et al.A novel hybrid algorithm for minimum total dominating set problem [J].Mathematics,2019,7(3):222232. [13] JIA L J,RAJARAMAN R,SUEL T.An efficient distributed algorithm for constructing small dominating sets [J].Distributed Computing,2002,15(4):193205. [14] JALLU R K,PRASAD P R,DAS G K.Distributed construction of connected dominating set in unit disk graphs [J].Journal of Parallel and Distributed Computing,2017,104:159166. [15] HJULER N,ITALIANO G F,PAROTSIDIS N,et al.Dominating sets and connected dominating sets in dynamic graphs [C]//Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019).Editors:Niedermeier R and Paul C,2019:135. [16] BOYAR J,EIDENBENZ S J,FAV RHOOLDT LM,et al.Online dominating set [J].Algorithmica,2019,81:19381964. [17] PRADHAN D,JHA A.On computing a minimum secure dominating set in block graphs [J].Journal of Combinatorial Optimization,2018,35:613631. [18] ADAWIYAH R,AGUSTIN I H,DAFIK,et al.Related wheelgraphs and its locating edge domination number [J].Journal of Physics Conference Series,2018,1022:18. [19] SUKHAMAY K.Relationship between optimal kdistance dominating sets in a weighted graph and its spanning trees [J].Information Processing Letters,2019,147:35. [20] HAYNES T W,HEDETNIEMI S T,SLATER P J.Fundamentals of domination in graphs [M].New York,USA:Marcel Dekker,1998. [21] PAWLAK Z.Rough sets [J].International Journal of Information & Computer Sciences,1982,11:341356. [22] WANG S P,ZHU Q X,ZHU W,et al.Equivalent characterizations of some graph problems by coveringbased rough sets [J].Journal of Applied Mathematics,2013,2013:17. [23] CATTANEO G,CHIASELOTTI G,CIUCCI D,et al.On theconnection of hypergraph theory with formal concept analysis and rough set theory [J].Information Sciences,2016,330(2):342357. [24] XU T H,WANG G Y.Finding strongly connected components of simple digraphs based on generalized rough sets theory [J].KnowledgeBased Systems,2018,149:8898. [25] CHEN J K,LIN Y J,LIN G P,et al.The relationship between attribute reducts in rough sets and minimal vertex covers of graphs [J].Information Sciences,2015,325:8797. [26] CHEN J K,LIN Y J,LI J J,et al.A rough set method for the minimum vertex cover problem of graphs [J].Applied Soft Computing,2016,42:360367. [27] XU Q Y,TAN A H,LI J J.A rough set method for the vertex cover problem in graph theory [J].Journal of Intelligent & Fuzzy Systems,2016,30:20032013. [28] TAN A H,TAO Y Z,WANG C.A roughset based solution of the total domination problem [C]//Polkowski L.et al.(eds) Rough Sets.IJCRS 2017.Lecture Notes in Computer Science,vol 10313,Springer,Cham,2017:131139. [29] TAN A H,LI J J,CHEN J K,et al.An Attribute ReductionMethod Based on Rough Sets for Dominating Sets of Graph [J].Pattern Recognition and Artificial Intelligence,2015,28(6):507512. [30] WANG J,WANG J.Reduction algorithms based on discernibility matrix:The order attributes method [J].Journal of Computer Science and Technology,2001,16(6):489504. [31] HU F,WANG G Y.Quick reduction algorithm basedon attributes order [J].Chinese Journal of Computer,2007,30(8):14291435. [32] HAN S Q,ZHAO M.Reduct Theory [M].Beijing:TsinghuaUniversity Press,2010:65264. [33] GUAN L H,WANG G Y,HU F.A decision rules mining algorithm based on attribute order [J].Control and Decision,2012,27(2):313316. 
[1]  YI Meng, LIANG Jiarong, QIN Bin. Approximate Algorithm for Minimum Virtual Backbone in 3D Wireless Ad Hoc Networks [J]. Computer Science, 2020, 47(7): 250256. 
[2]  HAN Bingqing, CHEN Yifei. Heterogeneous Chain Dominating Set Algorithm in Wireless Ad Hoc Networks [J]. Computer Science, 2018, 45(9): 135140. 
[3]  ZHANG Xiujun, WU Pu, YANG Hong and SHAO Zehui. Lineartime Algorithm for Weighted Domination Problem of Strongly Chordal Graph Based on Local Ratio Method [J]. Computer Science, 2017, 44(Z6): 129132. 
[4]  LUO Weizhong, CAI Zhaoquan, LAN Yuandong and LIU Yunlong. Reduction Algorithm for Total Dominating Set [J]. Computer Science, 2017, 44(Z11): 115118. 
[5]  YIN Jia, CHENG Chunling and ZHOU Jian. Diverse Ranking Algorithm Based on Minimal Independent Dominating Set [J]. Computer Science, 2017, 44(8): 181186. 
[6]  MA Chenming, WANG Wanliang and HONG Zhen. Improved Energy Efficient Data Gathering Protocol in Wireless Sensor Network [J]. Computer Science, 2015, 42(2): 6569. 
[7]  . Improved Algorithm of Sticker Model in Two Special Problem [J]. Computer Science, 2012, 39(Z11): 252255. 
[8]  . Clusterbased Distributed Consensus Algorithms Based on Connected Dominating Set in WSN [J]. Computer Science, 2012, 39(Z11): 5557. 
[9]  . Algorithms for Dominating Set Problems in OTIS Networks [J]. Computer Science, 2012, 39(3): 9397. 
[10]  . Fast Approximation Algorithm Based on Adjacent Matrix for Construction Virtual Backbone [J]. Computer Science, 2012, 39(3): 8387. 
[11]  LI Wenxiang,XIONG Qingguo,YANG Lintao. (School of information Science & Engineering, Wuhan University of Science & Technology, Wuhan 430081, China);(School of Electronics Information, Wuhan University, Wuhan 430079 , China) [J]. Computer Science, 2010, 37(7): 8790. 
[12]  WANG Jianxin,CHEN Beiwei,CHEN Jianer. Algorithms for Dominating Problems:A Survey [J]. Computer Science, 2010, 37(2): 711. 
[13]  GUO Panhong, YANG Yang,LI Xinyou. Backbone for Heterogeneous Ad hoc Networks and their Performance Analysis [J]. Computer Science, 2009, 36(10): 101103. 
[14]  LI ZhenJian, GE Qi ,WANG HaiTao ,ZHU Hong （Dept. of Computer Science and Engineering, Fudan University,Shanghai 200433）. [J]. Computer Science, 2007, 34(1): 177178. 
[15]  MA Jun, ZHU Hong （Laboratory for Intelligent Information Processing, Fudan University, Shanghai 200433）. [J]. Computer Science, 2006, 33(1): 220222. 
