Grouped domination parameterized by vertex cover, twin cover, and beyond
From MaRDI portal
Publication:6057339
DOI10.1007/978-3-031-30448-4_19arXiv2302.06983MaRDI QIDQ6057339
Saeki Uda, Hirotaka Ono, Tesshu Hanaka, Yota Otachi
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.06983
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- A survey of the algorithmic aspects of modular decomposition
- Improved upper bounds for vertex cover
- Finding a dominating set on bipartite graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Computing a minimum paired-dominating set in strongly orderable graphs
- Algorithmic meta-theorems for restrictions of treewidth
- The complexity of first-order and monadic second-order logic revisited
- Paired-domination problem on distance-hereditary graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Easy problems for tree-decomposable graphs
- Paired Domination in Graphs
- Paired-domination in graphs
- Deciding First-Order Properties of Nowhere Dense Graphs
- Twin-width I: Tractable FO Model Checking
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized Algorithms
- Complexity of paired domination in at-free and planar graphs
This page was built for publication: Grouped domination parameterized by vertex cover, twin cover, and beyond
