Exact (exponential) algorithms for the dominating set problem

被引：0
|
作者：
Fomin, FV [1 ]
Kratsch, D
Woeginger, GJ
机构：
[1] Univ Bergen, Dept Informat, N-5020 Bergen, Norway
[2] Univ Metz, LITA, F-57045 Metz 01, France
[3] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
来源：
GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2004年 / 3353卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our time complexities are exponential in the number eta of vertices. The contribution of this paper are 'nice' exponential time complexities that are bounded by functions of the form c(eta) with reasonably small constants c < 2: For arbitrary graphs we get a time complexity of 1.93782(eta). And for the special cases of split graphs, bipartite graphs, and graphs of maximum degree three, we reach time complexities of 1.41422(eta), 1.732061(eta), and 1.51433(eta), respectively.
引用
收藏
页码：245 / 256
页数：12
相关论文
共 50 条
  • [21] Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
    Wong, Renata
    Chang, Weng-Long
    Chung, Wen-Yu
    Vasilakos, Athanasios V.
    SCIENTIFIC REPORTS, 2023, 13 (01)
  • [22] Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
    Renata Wong
    Weng-Long Chang
    Wen-Yu Chung
    Athanasios V. Vasilakos
    Scientific Reports, 13
  • [23] Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation
    Dublois, Louis
    Lampis, Michael
    Paschos, Vangelis Th
    THEORETICAL COMPUTER SCIENCE, 2022, 923 : 271 - 291
  • [24] Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3
    Xiao, Mingyu
    Nagamochi, Hiroshi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03): : 408 - 418
  • [25] Exact algorithms for annotated edge dominating set in graphs with degree bounded by 3
    Xiao, Mingyu
    Nagamochi, Hiroshi
    IEICE Transactions on Information and Systems, 2013, E96-D (03) : 408 - 418
  • [26] Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
    Xiao, Mingyu
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 387 - 400
  • [27] Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs
    Gang Lu
    Journal of Electronic Science and Technology, 2009, 7 (03) : 214 - 222
  • [28] Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs
    Gang Lu MingTian Zhou Yong Tang MingYuan Zhao XinZheng Niu and Kun She are with School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China
    Journal of Electronic Science and Technology of China, 2009, 7 (03) : 214 - 222
  • [29] Exact Exponential Algorithms
    Fomin, Fedor V.
    Kaski, Peteri
    COMMUNICATIONS OF THE ACM, 2013, 56 (03) : 80 - 88
  • [30] Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size
    Chapelle, Mathieu
    Cochefert, Manfred
    Kratsch, Dieter
    Letourneur, Romain
    Liedloff, Mathieu
    PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 147 - 158
12345