Complexity of Secure Sets

DOI10.1007/978-3-662-53174-7_5zbMath1417.68061OpenAlexW2964156832MaRDI QIDQ2827802

Bernhard Bliem, Stefan Woltran

Publication date: 21 October 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53174-7_5

zbMATH Keywords

computational complexitycomplexity analysissecure sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Defensive alliances in graphs of bounded treewidth ⋮ Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs ⋮ Complexity of secure sets

Cites Work

• Unnamed Item
• Complexity of clique coloring and related problems
• Global secure sets of grid-like graphs
• Generalizations of matched CNF formulas
• Security in graphs
• The D-FLAT System for Dynamic Programming on Tree Decompositions

This page was built for publication: Complexity of Secure Sets