Computing the Clique-width of Cactus Graphs
Authors:
- J. Leonardo González-RuizJGJ. Leonardo González-Ruiz
- J. Raymundo Marcial-RomeroJMJ. Raymundo Marcial-Romero
- J.A. Hernández-ServínJHJ.A. Hernández-Servín
Open Access
- 1 December 2016
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 328, 47-57
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Graph classes with and without powers of bounded clique-widthDiscrete Applied Mathematics, 2016
- Practical algorithms for MSO model-checking on tree-decomposable graphsComputer Science Review, 2014
- The complexity of counting homomorphisms to cactus graphs modulo 2ACM Transactions on Computation Theory, 2014
- Polynomial-time recognition of clique-width ≤3 graphsDiscrete Applied Mathematics, 2012
- Intractability of Clique-Width ParameterizationsSIAM Journal on Computing, 2010
- Approximating clique-width and branch-widthJournal of Combinatorial Theory, Series B, 2006
- Upper bounds to the clique width of graphsDiscrete Applied Mathematics, 2000
- Handle-rewriting hypergraph grammarsJournal of Computer and System Sciences, 1993
- Economic Evaluation of Loop Feeder Relief AlternativesBell System Technical Journal, 1980
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979