Secure set algorithms and complexity

MaRDI QIDQ3429552zbMATH OpenFDO

Authors Ronald D. Dutton

Publication date 2 April 2007

zbMATH Keywords

computational complexitydefensive alliances

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parameterized complexity of secure sets
• Rooted secure sets of trees
• Complexity of secure sets
• Bounds on a graph's security number
• Complexity of secure sets

Cited in

(10)

• A Gröbner-Shirshov algorithm for applications in internet security
• Complexity of secure sets
• Secret sets and applications
• On secret set schemes
• Computing secure sets in graphs using answer set programming
• Parameterized complexity of secure sets
• scientific article; zbMATH DE number 7758317 (Why is no real title available?)
• Rooted secure sets of trees
• Global secure sets of grid-like graphs
• Complexity of secure sets

This page was built for publication: Secure set algorithms and complexity

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