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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 32; no. 1; pp. 226 - 243
Main Author:	Malyshev, D. S.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2016
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!