Approximate the Clique-Width of a Graph Using Shortest Paths
- 21 October 2021
- book chapter
- Published by Springer Nature
- p. 337-347
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Computing the Clique-Width of Polygonal Tree Graphs2017
- Computing the Clique-width of Cactus GraphsElectronic Notes in Theoretical Computer Science, 2016
- Practical algorithms for MSO model-checking on tree-decomposable graphsComputer Science Review, 2014
- A SAT Approach to Clique-Width2013
- Polynomial-time recognition of clique-width ≤3 graphsDiscrete Applied Mathematics, 2012
- Graph-Theoretic Concepts in Computer Science2010
- Clique-Width is NP-CompleteSIAM Journal on Discrete Mathematics, 2009
- Upper bounds to the clique width of graphsDiscrete Applied Mathematics, 2000
- Parameterized Complexity1999
- Handle-rewriting hypergraph grammarsJournal of Computer and System Sciences, 1993