Domination When the Stars Are Out
type: Item
instance of: scholarly article
title: Domination When the Stars Are Out
zbMATH Open document ID: 1334.68160
zbMATH Open document ID: 1454.68104
DOI: 10.1007/978-3-642-22006-7_39
DOI: 10.1145/3301445
author: Danny Hermelin
author: Matthias Mnich
author: Erik Jan van Leeuwen
author: Gerhard J. Woeginger
published in: Automata, Languages and Programming
published in: ACM Transactions on Algorithms
publication date: 2011-07-06T00:00:00Z
publication date: 2019-11-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/1012.0012
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q27
zbMATH DE Number: 5917984
zbMATH DE Number: 7136417
MaRDI profile type: Publication
OpenAlex ID: W3147303226
OpenAlex ID: W2942029771
arXiv ID: 1012.0012
zbMATH Keywords: claw-free graphs
zbMATH Keywords: connected dominating set
zbMATH Keywords: dominating set
zbMATH Keywords: fixed-parameter tractable
zbMATH Keywords: polynomial kernel
cites work: On domination and independent domination numbers of a graph
cites work: On problems without polynomial kernels
cites work: An approximate version of Hadwiger's conjecture for claw-free graphs
cites work: Coloring quasi-line graphs
cites work: Q3416248
cites work: Claw-free graphs. V. Global structure
cites work: Dominating set is fixed parameter tractable in claw-free graphs
cites work: Parameterized and Exact Computation
cites work: Q4027320
cites work: Paths, Trees, and Flowers
cites work: The stable set polytope of quasi-line graphs
cites work: Claw-free graphs---a survey
cites work: Q5365068
cites work: A threshold of ln n for approximating set cover
cites work: edge dominating set: Efficient Enumeration-Based Exact Algorithms
cites work: The stable set polytope of claw-free graphs with large stability number
cites work: Q4368728
cites work: Q4368729
cites work: Linear time algorithms on circular-arc graphs
cites work: Q4142699
cites work: Bounding χ in terms of ω and Δ for quasi-line graphs
cites work: Parameterized Complexity of Independence and Domination on Geometric Graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: The effect of girth on the kernelization complexity of connected dominating set
cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
cites work: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
cites work: Constrained weighted matchings and edge coverings in graphs
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
cites work: Edge Dominating Sets in Graphs
Wikidata QID: Q128003225
description: scientific article; zbMATH DE number 7136417