Complexity of secure sets

DOI10.1007/978-3-662-53174-7_5MaRDI QIDQ2827802zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Complexity of secure sets
• Parameterized complexity of secure sets
• Secure set algorithms and complexity
• Complexity issues of variants of secure domination in graphs
• The complexity of secure domination problem in graphs

Cites work

• Complexity of clique coloring and related problems
• Generalizations of matched CNF formulas
• Global secure sets of grid-like graphs
• Parameterized complexity of secure sets
• Security in graphs
• The D-FLAT system for dynamic programming on tree decompositions

Cited in

(11)

• Secure sets and their expansion in cubic graphs
• Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
• Complexity of eternal security
• Secret sets and applications
• Defensive alliances in graphs of bounded treewidth
• Complexity of secure sets
• scientific article; zbMATH DE number 7758317 (Why is no real title available?)
• Secure set algorithms and complexity
• The possible cardinalities of global secure sets in cographs
• Parameterized complexity of secure sets
• Computing secure sets in graphs using answer set programming

This page was built for publication: Complexity of secure sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827802)