Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
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 Clique-Width of Perfect Graph Classes
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
NLC2-Decomposition in Polynomial Time
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
NLCk for k = 1, . . . is a family of algebras on vertex-labeled graphs introduced by Wanke. An NLC-decomposition of a graph is a derivation of this graph from single vertices using the operations in question. The width of such a decomposition is the number of labels used, and the NLC-width of a graph is the minimum width among its NLC-decompositions. Many difficult graph problems can be solved efficiently with dynamic programming if an NLC-decomposition of low width is given for the input graph. This paper shows that an NLCdecomposition of width at most log n times the optimal width k can be found in O(n2k+1) time. Related concept: clique-width.