An exact algorithm for lowest edge dominating set

被引：0
|
作者：
Department of AppliedMathematics and Physics, Graduate School of Informatics, Kyoto University, Kyotoshi [1 ]
606-8501, Japan
机构：
来源：
IEICE Trans Inf Syst | / 3卷 / 414-421期
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Computation theory
引用
收藏
相关论文
共 50 条
  • [1] An Exact Algorithm for Lowest Edge Dominating Set
    Iwaide, Ken
    Nagamochi, Hiroshi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (03): : 414 - 421
  • [2] A refined exact algorithm for Edge Dominating Set
    Xiao, Mingyu
    Nagarnochi, Hiroshi
    THEORETICAL COMPUTER SCIENCE, 2014, 560 : 207 - 216
  • [3] 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
  • [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 improved algorithm for parameterized edge dominating set problem
    Iwaide, Ken
    Nagamochi, Hiroshi
    Journal of Graph Algorithms and Applications, 2016, 20 (01): : 23 - 58
  • [7] An exact algorithm for connected red-blue dominating set
    Abu-Khzam, Faisal N.
    Mouawad, Amer E.
    Liedloff, Mathieu
    JOURNAL OF DISCRETE ALGORITHMS, 2011, 9 (03) : 252 - 262
  • [8] An improved exact algorithm for minimum dominating set in chordal graphs
    Abu-Khzam, Faisal N.
    INFORMATION PROCESSING LETTERS, 2022, 174
  • [9] EDGE DOMINATING SET: Efficient enumeration-based exact algorithms
    Fernau, Henning
    PARAMETERIZED AND EXACT COMPUTATION,PROCEEDINGS, 2006, 4169 : 142 - 153
  • [10] Design by measure and conquer a faster exact algorithm for dominating set
    Van Rooij, Johan M. M.
    Bodlaender, Hans L.
    STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 657 - 667
12345