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 条
12345