Computing the Clique-width of Cactus Graphs

被引：1
|
作者：
Leonardo Gonzalez-Ruiz, J. [1 ]
Raymundo Marcial-Romero, J. [1 ]
Hernandez-Servin, J. A. [1 ]
机构：
[1] Univ Autonoma Estado Mexico, Fac Ingn, Toluca, Mexico
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2016年 / 328卷 / 328期
关键词：
Graph theory; Clique-width; Tree-width; Complexity;
D O I：
10.1016/j.entcs.2016.11.005
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Similar to the tree-width (twd), the clique-width (cwd) is an invariant of graphs. A well known relationship between tree-width and clique-width is that cwd(G) <= 3. 2(twd(G)) (1. I)t is also known that tree-width of Cactus graphs is 2, therefore the clique-width for those graphs is smaller or equal than 6. In this paper, it is shown that the clique-width of Cactus graphs is smaller or equal to 4 and we present a polynomial time algorithm which computes exactly a 4-expression.
引用
收藏
页码：47 / 57
页数：11
相关论文
共 50 条
  • [31] INDUCTIVE COMPUTATIONS ON GRAPHS DEFINED BY CLIQUE-WIDTH EXPRESSIONS
    Carrere, Frederique
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, 43 (03): : 625 - 651
  • [32] Induced Minor Free Graphs: Isomorphism and Clique-width
    Belmonte, Remy
    Otachi, Yota
    Schweitzer, Pascal
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, 9224 : 299 - 311
  • [33] Succinct data structures for bounded clique-width graphs
    Chakraborty, Sankardeep
    Jo, Seungbum
    Sadakane, Kunihiko
    Satti, Srinivasa Rao
    DISCRETE APPLIED MATHEMATICS, 2024, 352 : 55 - 68
  • [34] Induced Minor Free Graphs: Isomorphism and Clique-Width
    Rémy Belmonte
    Yota Otachi
    Pascal Schweitzer
    Algorithmica, 2018, 80 : 29 - 47
  • [35] On the linear structure and clique-width of bipartite permutation graphs
    Brandstädt, A
    Lozin, VV
    ARS COMBINATORIA, 2003, 67 : 273 - 281
  • [36] Succinct Data Structures for Small Clique-Width Graphs
    Chakraborty, Sankardeep
    Jo, Seungbum
    Sadakane, Kunihiko
    Satti, Srinivasa Rao
    2021 DATA COMPRESSION CONFERENCE (DCC 2021), 2021, : 133 - 142
  • [37] Feedback vertex set on graphs of low clique-width
    Binh-Minh Bui-Xuan
    Suchy, Ondrej
    Telle, Jan Arne
    Vatshelle, Martin
    EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (03) : 666 - 679
  • [38] Induced Minor Free Graphs: Isomorphism and Clique-Width
    Belmonte, Remy
    Otachi, Yota
    Schweitzer, Pascal
    ALGORITHMICA, 2018, 80 (01) : 29 - 47
  • [39] Compact Navigation Oracles for Graphs with Bounded Clique-Width
    Kamali, Shahin
    2016 DATA COMPRESSION CONFERENCE (DCC), 2016, : 566 - 576
  • [40] Query efficient implementation of graphs of bounded clique-width
    Courcelle, B
    Vanicat, R
    DISCRETE APPLIED MATHEMATICS, 2003, 131 (01) : 129 - 150
12345