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 条
  • [1] Exact algorithms for dominating set
    van Rooij, Johan M. M.
    Bodlaender, Hans L.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (17) : 2147 - 2164
  • [2] Exponential time algorithms for the minimum dominating set problem on some graph classes
    Gaspers, Serge
    Kratsch, Dieter
    Liedloff, Mathieu
    ALGORITHM THEORY - SWAT 2006, PROCEEDINGS, 2006, 4059 : 148 - 159
  • [3] Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
    Gaspers, Serge
    Kratsch, Dieter
    Liedloff, Mathieu
    Todinca, Ioan
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 6 (01)
  • [4] An Exact Exponential Time Algorithm for Power Dominating Set
    Daniel Binkele-Raible
    Henning Fernau
    Algorithmica, 2012, 63 : 323 - 346
  • [5] An Exact Exponential Time Algorithm for Power Dominating Set
    Binkele-Raible, Daniel
    Fernau, Henning
    ALGORITHMICA, 2012, 63 (1-2) : 323 - 346
  • [6] An Exact Algorithm for the Minimum Dominating Set Problem
    Jiang, Hua
    Zheng, Zhifei
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 5604 - 5612
  • [7] On-line algorithms for the dominating set problem
    Dept. of Comp. and Info. Science, National Chiao Tung University, Hsinchu 30050, Taiwan
    Inf. Process. Lett., 1 (11-14):
  • [8] On-line algorithms for the dominating set problem
    King, GH
    Tzeng, WG
    INFORMATION PROCESSING LETTERS, 1997, 61 (01) : 11 - 14
  • [9] Exact algorithms for finding the minimum independent dominating set in graphs
    Liu, Chunmei
    Song, Yinglei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 439 - +
  • [10] Dominating set based exact algorithms for 3-coloring
    Narayanaswamy, N. S.
    Subramanian, C. R.
    INFORMATION PROCESSING LETTERS, 2011, 111 (06) : 251 - 255
12345