Parameterized complexity of secure sets

MaRDI QIDQ3616016zbMATH OpenFDO

Authors Rosa I. Enciso, Ronald D. Dutton

Publication date 24 March 2009

zbMATH Keywords

defensive alliancesFPT-algorithmsparameterized complexitysecure sets

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Complexity of secure sets
• Complexity of secure sets
• Secure set algorithms and complexity
• Parameterized complexity of safe set
• Rooted secure sets of trees

Cited in

(10)

• On the security number of the Cartesian product of graphs
• Parameterized complexity of safe set
• Global edge alliances in graphs
• Complexity of secure sets
• Computing secure sets in graphs using answer set programming
• Secure set algorithms and complexity
• Parameterized complexity of safe set
• scientific article; zbMATH DE number 7758317 (Why is no real title available?)
• Global secure sets of grid-like graphs
• Complexity of secure sets

This page was built for publication: Parameterized complexity of secure sets

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