Computing the clique-width of cactus graphs

DOI10.1016/j.entcs.2016.11.005zbMath1395.05144OpenAlexW2562038402WikidataQ113317621 ScholiaQ113317621MaRDI QIDQ1744436

J. A. Hernández-Servín, J. Raymundo Marcial-Romero, J. Leonardo González-Ruiz

Publication date: 23 April 2018

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.11.005

zbMATH Keywords

complexityclique-widthtree-width

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-time recognition of clique-width \(\leq 3\) graphs
• Practical algorithms for MSO model-checking on tree-decomposable graphs
• Graph classes with and without powers of bounded clique-width
• Upper bounds to the clique width of graphs
• Handle-rewriting hypergraph grammars
• Line graphs of bounded clique-width
• Approximating clique-width and branch-width
• Intractability of Clique-Width Parameterizations
• Centdian Computation for Sensor Networks
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers

This page was built for publication: Computing the clique-width of cactus graphs