Deciding Clique-Width for Graphs of Bounded Tree-Width
From MaRDI portal
Publication:4435348
DOI10.7155/jgaa.00065zbMath1027.05093OpenAlexW2112067601MaRDI QIDQ4435348
Frank Gurski, Egon Wanke, W. Espelage
Publication date: 30 November 2003
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/50437
Related Items (22)
Vertex cover meets scheduling ⋮ Polynomial algorithms for protein similarity search for restricted mRNA structures ⋮ On quasi-planar graphs: clique-width and logical description ⋮ MSOL partitioning problems on graphs of bounded treewidth and clique-width ⋮ From tree-decompositions to clique-width terms ⋮ Structure and algorithms for (cap, even hole)-free graphs ⋮ Polynomial-time recognition of clique-width \(\leq 3\) graphs ⋮ Directed NLC-width ⋮ Line graphs of bounded clique-width ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ On a disparity between relative cliquewidth and relative NLC-width ⋮ Approximating clique-width and branch-width ⋮ Linear layouts measuring neighbourhoods in graphs ⋮ Vertex disjoint paths on clique-width bounded graphs ⋮ Measuring what matters: a hybrid approach to dynamic programming with treewidth ⋮ Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. ⋮ Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width ⋮ Graph operations characterizing rank-width ⋮ On the relationship between NLC-width and linear NLC-width ⋮ Regular independent sets
This page was built for publication: Deciding Clique-Width for Graphs of Bounded Tree-Width
