On -stable locally checkable problems parameterized by mim-width
Authors:
- Carolina Lucía GonzalezCGCarolina Lucía Gonzalez
- Felix MannFMFelix Mann
Open Access
- 4 January 2024
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 347, 1-22
Abstract
No abstract availableKeywords
Funding Information
- Universidad de Buenos Aires Secretaria de Ciencia y Tecnica
- Secretaría de Ciencia y Técnica, Universidad de Buenos Aires (20020170100495BA)
- Agencia Nacional de Promoción Científica y Tecnológica
- Consejo Nacional de Investigaciones Científicas y Técnicas
- Agencia Nacional de Promoción Científica y Tecnológica (PICT-2021-I-A-00755)
This publication has 24 references indexed in Scilit:
- Algorithmic aspects of homophyly of networksTheoretical Computer Science, 2015
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidthInformation and Computation, 2015
- Graph classes with structured neighborhoods and algorithmic applicationsTheoretical Computer Science, 2013
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problemsTheoretical Computer Science, 2013
- Signed Roman domination in graphsJournal of Combinatorial Optimization, 2012
- Locally boundedk-colorings of treesRAIRO - Operations Research, 2009
- Roman domination in graphsDiscrete Mathematics, 2004
- The b-chromatic number of a graphDiscrete Applied Mathematics, 1999
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980