Computing the Clique-Width on Series-Parallel Graphs

被引：0
|
作者：
Antonio Lopez-Medina, Marco [1 ]
Leonardo Gonzalez-Ruiz, J. [1 ]
Raymundo Marcial-Romero, J. [1 ]
Hernandez, J. A. [1 ]
机构：
[1] Univ Autonoma Estado Mexico, Fac Ingn, Toluca De Lerdo, Mexico
来源：
COMPUTACION Y SISTEMAS | 2022年 / 26卷 / 02期
关键词：
Graph theory; clique-width; tree-width; complexity; series-parallel;
D O I：
10.13053/CyS-26-2-4250
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The clique-width (cwd) is an invariant of graphs which, similar to other invariants like the tree-width (twd) establishes a parameter for the complexity of a problem. For example, several problems with bounded clique-width can be solved in polynomial time. There is a well known relation between tree-width and clique-width denoted as cwd(G) <= 3 center dot 2(twd(G)-1). Serial-parallel graphs have tree-width of at most 2, so its clique-width is at most 6 according to the previous relation. In this paper, we improve the bound for this particular case, showing that the clique-width of series-parallel graphs is smaller or equal to 5.
引用
收藏
页码：815 / 822
页数：8
相关论文
共 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] Computing the Clique-Width of Polygonal Tree Graphs
    Leonardo Gonzalez-Ruiz, J.
    Raymundo Marcial-Romero, J.
    Hernandez, J. A.
    De Ita, Guillermo
    ADVANCES IN SOFT COMPUTING, MICAI 2016, PT II, 2017, 10062 : 449 - 459
  • [3] Between clique-width and linear clique-width of bipartite graphs
    Alecu, Bogdan
    Kante, Mamadou Moustapha
    Lozin, Vadim
    Zamaraev, Viktor
    DISCRETE MATHEMATICS, 2020, 343 (08)
  • [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 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
  • [6] 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
  • [7] Bipartite Graphs of Large Clique-Width
    Korpelainen, Nicholas
    Lozin, Vadim V.
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 385 - +
  • [8] On the clique-width of graphs in hereditary classes
    Boliac, R
    Lozin, V
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 44 - 54
  • [9] Alliances in graphs of bounded clique-width
    Otachi, Yota (otachi@jaist.ac.jp), 2017, Elsevier B.V., Netherlands (223)
  • [10] Graphs of linear clique-width at most
    Heggernes, Pinar
    Meister, Daniel
    Papadopoulos, Charis
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2008, 4978 : 330 - 341
12345