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

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 80; číslo 10; s. 2909 - 2940
Hlavní autoři:	Bliem, Bernhard, Woltran, Stefan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2018 Springer Nature B.V
Témata:	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
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!