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 条
  • [41] A local characterization of bounded clique-width for line graphs
    Gurski, Frank
    Wanke, Egon
    DISCRETE MATHEMATICS, 2007, 307 (06) : 756 - 759
  • [42] Optimal Centrality Computations Within Bounded Clique-Width Graphs
    Guillaume Ducoffe
    Algorithmica, 2022, 84 : 3192 - 3222
  • [43] Constrained-Path Labellings on Graphs of Bounded Clique-Width
    Bruno Courcelle
    Andrew Twigg
    Theory of Computing Systems, 2010, 47 : 531 - 567
  • [44] Infinitely many minimal classes of graphs of unbounded clique-width
    Collins, A.
    Foniok, J.
    Korpelainen, N.
    Lozin, V.
    Zamaraev, V.
    DISCRETE APPLIED MATHEMATICS, 2018, 248 : 145 - 152
  • [45] Chordal bipartite graphs of bounded tree- and clique-width
    Lozin, V
    Rautenbach, D
    DISCRETE MATHEMATICS, 2004, 283 (1-3) : 151 - 158
  • [46] Constrained-Path Labellings on Graphs of Bounded Clique-Width
    Courcelle, Bruno
    Twigg, Andrew
    THEORY OF COMPUTING SYSTEMS, 2010, 47 (02) : 531 - 567
  • [47] The tree- and clique-width of bipartite graphs in special classes
    Lozin, V. V.
    Rautenbach, D.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2006, 34 : 57 - 67
  • [48] Clique-width of graphs defined by one-vertex extensions
    Rao, Michael
    DISCRETE MATHEMATICS, 2008, 308 (24) : 6157 - 6165
  • [49] Optimal Centrality Computations Within Bounded Clique-Width Graphs
    Ducoffe, Guillaume
    ALGORITHMICA, 2022, 84 (11) : 3192 - 3222
  • [50] Polynomial-time recognition of clique-width ≤ 3 graphs
    Corneil, Derek G.
    Habib, Michel
    Lanlignel, Jean-Marc
    Reed, Bruce
    Rotics, Udi
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (06) : 834 - 865
12345