Efficiency in exponential time for domination-type problems
type: Item
instance of: scholarly article
title: Efficiency in exponential time for domination-type problems
zbMATH Open document ID: 1156.05058
author: Ingo Schiermeyer
published in: Discrete Applied Mathematics
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5522969
zbMATH Keywords: exact algorithms
zbMATH Keywords: domination
zbMATH Keywords: matching technique
MaRDI profile type: Publication
full work available at URL: j.dam.2008.05.035
OpenAlex ID: W1993301031
cites work: Q4711895
cites work: Q4944990
cites work: Spanning trees with many leaves
cites work: Q4393480
cites work: The complexity of colouring problems on dense graphs
cites work: Q4778579
cites work: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction.
cites work: Q4417671
cites work: Automata, Languages and Programming
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4198056
cites work: Q4368728
cites work: Q4368729
cites work: Q4252414
cites work: A note on the complexity of the chromatic number problem
cites work: Domination in graphs with minimum degree two
cites work: On cliques in graphs
cites work: A general method to speed up fixed-parameter-tractable algorithms
cites work: Q4108373
cites work: Vertex colouring and forbidden subgraphs -- a survey
cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
cites work: Paths, Stars and the Number Three
cites work: Algorithms for maximum independent sets
cites work: Q4882469
cites work: Q5509541
cites work: Q4414647
DOI: 10.1016/J.DAM.2008.05.035
description: scientific article; zbMATH DE number 5522969