Trivially-Perfect Width

被引:0
|
作者
Hung, Ling-Ju [1 ]
Kloks, Ton [2 ]
Lee, Chuan Min
机构
[1] Natl Chung Cheng Univ, Dept Comp Sci & Informat Engn, Chiayi 621, Taiwan
[2] Taoyuan County 333, Guishan Dist, Taoyuan, Taiwan
来源
COMBINATORIAL ALGORITHMS | 2009年 / 5874卷
关键词
GRAPH;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The g-width of a. class of graphs g is defined as follows. A graph C; has g-width k if there are k independent sets N-1,...,N-k in G such that C; can be embedded into a. graph H is an element of G with the property that for every edge e in H which is not an edge in C, there exists an i such that both endpoints of e are in N1. For the class TB of trivially-perfect graphs we show that TB-width is NP-complete and we present fixed-parameter algorithms.
引用
收藏
页码:301 / +
页数:2
相关论文
共 50 条
  • [1] TRIVIALLY PERFECT GRAPHS
    GOLUMBIC, MC
    [J]. DISCRETE MATHEMATICS, 1978, 24 (01) : 105 - 107
  • [2] On Polar, Trivially Perfect Graphs
    Talmaciu, M.
    Nechita, E.
    [J]. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2010, 5 (05) : 939 - 945
  • [3] A Polynomial Kernel for Trivially Perfect Editing
    Drange, Pal Gronas
    Pilipczuk, Michal
    [J]. ALGORITHMICA, 2018, 80 (12) : 3481 - 3524
  • [4] A Polynomial Kernel for Trivially Perfect Editing
    Pål Grønås Drange
    Michał Pilipczuk
    [J]. Algorithmica, 2018, 80 : 3481 - 3524
  • [5] A Polynomial Kernel for Trivially Perfect Editing
    Drange, Pal Gronas
    Pilipczuk, Michal
    [J]. ALGORITHMS - ESA 2015, 2015, 9294 : 424 - 436
  • [6] Probe threshold and probe trivially perfect graphs
    Bayer, Daniel
    Le, Van Bang
    de Ridder, H. N.
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 4812 - 4822
  • [7] A new characterization of trivially perfect graphs
    Rubio-Montiel, Christian
    [J]. ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2015, 3 (01) : 22 - 26
  • [8] An Algorithm For The Bisection Problem On Trivially Perfect Graphs
    Talmaciu, Mihai
    Nechita, Elena
    [J]. ADVANCED BIO-INSPIRED COMPUTATIONAL METHODS, 2008, : 87 - 93
  • [9] A Cubic Vertex-Kernel for TRIVIALLY PERFECT EDITING
    Dumas, Mael
    Perez, Anthony
    Todinca, Ioan
    [J]. ALGORITHMICA, 2023, 85 (04) : 1091 - 1110
  • [10] An Algorithm for the Bisection Problem on Trivially Perfect Graphs
    Talmaciu, Mihai
    Nechita, Elena
    [J]. BICS 2008: PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTATIONAL METHODS USED FOR SOLVING DIFFICULT PROBLEMS-DEVELOPMENT OF INTELLIGENT AND COMPLEX SYSTEMS, 2008, 1117 : 60 - 66