Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
SIAM Journal on Discrete Mathematics
On the Relationship Between Clique-Width and Treewidth
SIAM Journal on Computing
New Graph Classes of Bounded Clique-Width
Theory of Computing Systems
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Finding Branch-Decompositions and Rank-Decompositions
SIAM Journal on Computing
Approximating rank-width and clique-width quickly
ACM Transactions on Algorithms (TALG)
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
A Complete Characterisation of the Linear Clique-Width of Path Powers
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
SIAM Journal on Discrete Mathematics
On a disparity between relative cliquewidth and relative NLC-width
Discrete Applied Mathematics
Width Parameters Beyond Tree-width and their Applications
The Computer Journal
| Hi-index | 0.01 |
Clique-width is an important graph parameter whose computation is NP-hard In fact we do not know of any algorithm other than brute force for the exact computation of clique-width on any graph class of unbounded clique-width, other than square grids Results so far indicate that proper interval graphs constitute the first interesting graph class on which we might have hope to compute clique-width, or at least its variant linear clique-width, in polynomial time In TAMC 2009, a polynomial-time algorithm for computing linear clique-width on a subclass of proper interval graphs was given In this paper, we present a polynomial-time algorithm for a larger subclass of proper interval graphs that approximates the clique-width within an additive factor 3 Previously known upper bounds on clique-width result in arbitrarily large difference from the actual clique-width when applied on this class Our results contribute toward the goal of eventually obtaining a polynomial-time exact algorithm for clique-width on proper interval graphs.