Computing the Clique-Width of Polygonal Tree Graphs

被引：2
|
作者：
Leonardo Gonzalez-Ruiz, J. [1 ]
Raymundo Marcial-Romero, J. [1 ]
Hernandez, J. A. [1 ]
De Ita, Guillermo [2 ]
机构：
[1] UAEM, Fac Ingn, Toluca, Mexico
[2] BUAP, Fac Ciencias Computac, Puebla, Mexico
来源：
ADVANCES IN SOFT COMPUTING, MICAI 2016, PT II | 2017年 / 10062卷
关键词：
D O I：
10.1007/978-3-319-62428-0_36
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Similar to the tree-width (twd), the clique-width (cwd) is an invariant of graphs. There is a well-known relationship between the tree-width and clique-width for any graph. The tree-width of a special class of graphs called polygonal trees is 2, so the clique-width for those graphs is smaller or equal than 6. In this paper we show that we can improve this bound to 5 and we present a polynomial time algorithm which computes the 5-expression.
引用
收藏
页码：449 / 459
页数：11
相关论文
共 50 条
  • [1] Computing the Clique-width of Cactus Graphs
    Leonardo Gonzalez-Ruiz, J.
    Raymundo Marcial-Romero, J.
    Hernandez-Servin, J. A.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2016, 328 (328) : 47 - 57
  • [2] Between clique-width and linear clique-width of bipartite graphs
    Alecu, Bogdan
    Kante, Mamadou Moustapha
    Lozin, Vadim
    Zamaraev, Viktor
    DISCRETE MATHEMATICS, 2020, 343 (08)
  • [3] Deciding clique-width for graphs of bounded tree-width
    Espelage, W
    Gurski, F
    Wanke, E
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 87 - 98
  • [4] Computing graph polynomials on graphs of bounded clique-width
    Makowsky, J. A.
    Rotics, Udi
    Averbouch, Ilya
    Godlin, Benny
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 191 - 204
  • [5] Computing the Clique-Width on Series-Parallel Graphs
    Antonio Lopez-Medina, Marco
    Leonardo Gonzalez-Ruiz, J.
    Raymundo Marcial-Romero, J.
    Hernandez, J. A.
    COMPUTACION Y SISTEMAS, 2022, 26 (02): : 815 - 822
  • [6] Computing the Tutte polynomial on graphs of bounded clique-width
    Giménez, O
    Hlineny, P
    Noy, M
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 59 - 68
  • [7] Computing the tutte polynomial on graphs of bounded clique-width
    Gimenez, Omer
    Hlineny, Petr
    Noy, Marc
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (04) : 932 - 946
  • [8] Chordal bipartite graphs of bounded tree- and clique-width
    Lozin, V
    Rautenbach, D
    DISCRETE MATHEMATICS, 2004, 283 (1-3) : 151 - 158
  • [9] The tree- and clique-width of bipartite graphs in special classes
    Lozin, V. V.
    Rautenbach, D.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2006, 34 : 57 - 67
  • [10] On the OBDD size for graphs of bounded tree- and clique-width
    Meer, Klaus
    Rautenbach, Dieter
    PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2006, 4169 : 72 - 83
12345