DOMINATION ON COCOMPARABILITY GRAPHS

被引：86
|
作者：
KRATSCH, D
STEWART, L
机构：
[1] UNIV ALBERTA,DEPT COMP SCI,EDMONTON T6G 2H1,AB,CANADA
[2] UNIV TORONTO,TORONTO M5S 1A1,ONTARIO,CANADA
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 1993年 / 6卷 / 03期
关键词：
DOMINATION; COCOMPARABILITY GRAPHS; GRAPH ALGORITHMS;
D O I：
10.1137/0406032
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The authors determine the algorithmic complexity of domination and variants on cocomparability graphs, a class of perfect graphs containing both the interval and the permutation graphs. Minimum dominating total dominating, connected dominating, and independent dominating sets can be constructed in polynomial time. On the other hand. DOMINATING CLIQUE and MINIMUM DOMiNATING CLIQUE remain NP-complete on cocomparability graphs.
引用
收藏
页码：400 / 417
页数：18
相关论文
共 50 条
  • [31] Generalized domination and efficient domination in graphs
    Bange, DW
    Barkauskas, AE
    Host, LH
    Slater, PJ
    DISCRETE MATHEMATICS, 1996, 159 (1-3) : 1 - 11
  • [32] DOMINATION AND INDEPENDENT DOMINATION NUMBERS OF GRAPHS
    SEIFTER, N
    ARS COMBINATORIA, 1994, 38 : 119 - 128
  • [33] Generalized domination and efficient domination in graphs
    Department of Mathematics, University of Wisconsin-LaCrosse, LaCrosse, WI 54601, United States
    不详
    Discrete Math, 1-3 (1-11):
  • [34] Domination versus disjunctive domination in graphs
    Henning, Michael A.
    Marcon, Sinclair A.
    QUAESTIONES MATHEMATICAE, 2016, 39 (02) : 261 - 273
  • [35] Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs
    Tan Nhat Tran
    Tsuchiya, Akiyoshi
    COMPTES RENDUS MATHEMATIQUE, 2021, 359 (06) : 665 - 674
  • [36] Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
    Dusart, Jeremie
    Habib, Michel
    Corneil, Derek G.
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2024, 41 (01): : 99 - 133
  • [37] Graphs that are simultaneously efficient open domination and efficient closed domination graphs
    Klavzar, Sandi
    Peterin, Iztok
    Yero, Ismael G.
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 613 - 621
  • [38] A SIMPLE POLYNOMIAL ALGORITHM FOR THE LONGEST PATH PROBLEM ON COCOMPARABILITY GRAPHS
    Mertzios, George B.
    Corneil, Derek G.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (03) : 940 - 963
  • [39] Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
    Jérémie Dusart
    Michel Habib
    Derek G. Corneil
    Order, 2024, 41 : 99 - 133
  • [40] Revisiting Domination, Hop Domination, and Global Hop Domination in Graphs
    Salasalan, Gemma
    Canoy Jr, Sergio R.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2021, 14 (04): : 1415 - 1428
12345