ON DOMINATION PROBLEMS FOR PERMUTATION AND OTHER GRAPHS

被引：49
|
作者：
BRANDSTADT, A
KRATSCH, D
机构：
[1] Friedrich-Schiller Univ Jena, Jena, East Ger, Friedrich-Schiller Univ Jena, Jena, East Ger
来源：
THEORETICAL COMPUTER SCIENCE | 1987年 / 54卷 / 2-3期
关键词：
COMPUTER PROGRAMMING - Algorithms;
D O I：
10.1016/0304-3975(87)90128-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
There is an increasing interest in results on the influence of restricting NP-complete graph problems, to special classes of perfect graphs as, e. g. , permutation graphs. In this paper we give (i) an algorithm with time bound O(n**2) for the weighted independent domination problem on permutation graphs (which is an improvement of the O(n**3) solution; (ii) a polynomial time solution for the weighted feedback vertex set problem on permutation graphs; (iii) an investigation of weighted dominating clique problems for several graph classes including an NP-completeness result for weakly triangulated graphs as well as polynomial time bounds.
引用
收藏
页码：181 / 198
页数：18
相关论文
共 50 条
  • [21] Solving the weighted efficient edge domination problem on bipartite permutation graphs
    Lu, CL
    Tang, CY
    DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 203 - 211
  • [22] On neighborhood graphs: Domination, coloring and other properties
    Das, Angsuman
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2022, 14 (04)
  • [23] The multiple domination and limited packing problems in graphs
    Dobson, M. P.
    Leoni, V.
    Nasini, G.
    INFORMATION PROCESSING LETTERS, 2011, 111 (23-24) : 1108 - 1113
  • [24] Parameterized Complexity for Domination Problems on Degenerate Graphs
    Golovach, Petr A.
    Villanger, Yngve
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2008, 5344 : 195 - 205
  • [25] Parallel algorithms for the domination problems in trapezoid graphs
    Liang, YD
    DISCRETE APPLIED MATHEMATICS, 1997, 74 (03) : 241 - 249
  • [26] An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
    Lappas, Evaggelos
    Nikolopoulos, Stavros D.
    Palios, Leonidas
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 368 - 379
  • [27] Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
    Foucaud, Florent
    Mertzios, George B.
    Naserasr, Reza
    Parreau, Aline
    Valicov, Petru
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, 9224 : 456 - 471
  • [28] A polynomial-time algorithm for the paired-domination problem on permutation graphs
    Cheng, T. C. E.
    Kang, Liying
    Shan, Erfang
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (02) : 262 - 271
  • [29] An efficient algorithm to solve the distance k-domination problem on permutation graphs
    Rana, Akul
    Pal, Anita
    Pal, Madhumangal
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2016, 19 (02): : 241 - 255
  • [30] Power domination number of sunlet graph and other graphs
    Saibavani, T. N.
    Parvathi, N.
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2019, 22 (06): : 1121 - 1127
12345