A complexity dichotomy and a new boundary class for the dominating set problem

We study the computational complexity of the dominating set problem for hereditary graph classes, i.e., classes of simple unlabeled graphs closed under deletion of vertices. Every hereditary class can be defined by a set of its forbidden induced subgraphs. There are numerous open cases for the compl...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of combinatorial optimization Ročník 32; číslo 1; s. 226 - 243
Hlavní autor:	Malyshev, D. S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.07.2016
Témata:	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Boundary class Polynomial-time algorithm Dominating set Computational complexity
ISSN:	1382-6905, 1573-2886
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!