Complexity of Secure Sets

A secure set S in a graph is defined as a set of vertices such that for any X ⊆ S the majority of vertices in the neighborhood of X belongs to S . It is known that deciding whether a set S is secure in a graph is co- NP -complete. However, it is still open how this result contributes to the actual c...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 80; no. 10; pp. 2909 - 2940
Main Authors:	Bliem, Bernhard, Woltran, Stefan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2018 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Mathematics of Computing Theory of Computation Upper bounds Complexity analysis Parameterized algorithms Secure set Parameterized complexity Treewidth
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!