In accordance with regulations and requirements, the editorial department's website domain has been changed to arocmag.cn. The original domain (arocmag.com) will be discontinued after Dec. 31st, 2024.
See More
Algorithm Research & Explore
|
App. Res. of Comp. Printed Article
Vol. 36, 2019 No. 9
2569-2574

Exact algorithm for connected dominating set in undirected graphs

Zhou Xiaoqing1,2
Ye Ansheng2
Zhang Zhiqiang2
1. School of Computer Science & Engineering, University of Electronic Science & Technology of China, Chengdu 611731, China
2. College of Information Science & Engineering, Chengdu University, Chengdu 610106, China
DOI: 10.19734/j.issn.1001-3695.2018.03.0154

Abstract

A dominating set D⊆V of a graph G=(V,E) was a subset of vertices, such that every vertex of G was either in D, or adjacent to at least one vertex in D. The connected dominating set problem asks to find a dominating set S with minimum number of vertices and the induced subgraph G[S] was connected. The connected dominating set problem was a classical NP-hard problem, which could be applied to connected facility location, Ad-hoc networks and many other areas. For the connected dominating set problem in undirected graphs, this paper carefully analyzed the structural properties, explored a number of effective reduction rules as well as branching rules and provided a branch-and-search algorithm. A measure-and-conquer method is also introduced to analyze the running time bound. Finally, an exact algorithm with a running time complexity of O*(1.93n) is obtained.

Foundation Support

国家重点研发计划资助项目(2016YFB0800605)
国家自然科学基金资助项目(61370071)
四川省教育厅科研项目重点项目(15ZA0354)

Publish Information

DOI: 10.19734/j.issn.1001-3695.2018.03.0154
Publish at: Application Research of Computers Printed Article, Vol. 36, 2019 No. 9
Section: Algorithm Research & Explore
Pages: 2569-2574
Serial Number: 1001-3695(2019)09-002-2569-06

Publish History

[2019-09-05] Printed Article

Cite This Article

周晓清, 叶安胜, 张志强. 无向图中连通支配集问题的精确算法 [J]. 计算机应用研究, 2019, 36 (9): 2569-2574. (Zhou Xiaoqing, Ye Ansheng, Zhang Zhiqiang. Exact algorithm for connected dominating set in undirected graphs [J]. Application Research of Computers, 2019, 36 (9): 2569-2574. )

About the Journal

  • Application Research of Computers Monthly Journal
  • Journal ID ISSN 1001-3695
    CN  51-1196/TP

Application Research of Computers, founded in 1984, is an academic journal of computing technology sponsored by Sichuan Institute of Computer Sciences under the Science and Technology Department of Sichuan Province.

Aiming at the urgently needed cutting-edge technology in this discipline, Application Research of Computers reflects the mainstream technology, hot technology and the latest development trend of computer application research at home and abroad in a timely manner. The main contents of the journal include high-level academic papers in this discipline, the latest scientific research results and major application results. The contents of the columns involve new theories of computer discipline, basic computer theory, algorithm theory research, algorithm design and analysis, blockchain technology, system software and software engineering technology, pattern recognition and artificial intelligence, architecture, advanced computing, parallel processing, database technology, computer network and communication technology, information security technology, computer image graphics and its latest hot application technology.

Application Research of Computers has many high-level readers and authors, and its readers are mainly senior and middle-level researchers and engineers engaged in the field of computer science, as well as teachers and students majoring in computer science and related majors in colleges and universities. Over the years, the total citation frequency and Web download rate of Application Research of Computers have been ranked among the top of similar academic journals in this discipline, and the academic papers published are highly popular among the readers for their novelty, academics, foresight, orientation and practicality.

Indexed & Evaluation

  • The Second National Periodical Award 100 Key Journals
  • Double Effect Journal of China Journal Formation
  • the Core Journal of China (Peking University 2023 Edition)
  • the Core Journal for Science
  • Chinese Science Citation Database (CSCD) Source Journals
  • RCCSE Chinese Core Academic Journals
  • Journal of China Computer Federation
  • 2020-2022 The World Journal Clout Index (WJCI) Report of Scientific and Technological Periodicals
  • Full-text Source Journal of China Science and Technology Periodicals Database
  • Source Journal of China Academic Journals Comprehensive Evaluation Database
  • Source Journals of China Academic Journals (CD-ROM Version), China Journal Network
  • 2017-2019 China Outstanding Academic Journals with International Influence (Natural Science and Engineering Technology)
  • Source Journal of Top Academic Papers (F5000) Program of China's Excellent Science and Technology Journals
  • Source Journal of China Engineering Technology Electronic Information Network and Electronic Technology Literature Database
  • Source Journal of British Science Digest (INSPEC)
  • Japan Science and Technology Agency (JST) Source Journal
  • Russian Journal of Abstracts (AJ, VINITI) Source Journals
  • Full-text Journal of EBSCO, USA
  • Cambridge Scientific Abstracts (Natural Sciences) (CSA(NS)) core journals
  • Poland Copernicus Index (IC)
  • Ulrichsweb (USA)