Secure set algorithms and complexity

zbMATH Open1111.68088MaRDI QIDQ3429552FDOQ3429552

Authors: Ronald D. Dutton 

Publication date: 2 April 2007

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

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)

Cited In (10)

• Secret sets and applications
• On secret set schemes
• Complexity of secure sets
• Complexity of secure sets
• Title not available (Why is that?)
• A Gröbner-Shirshov algorithm for applications in internet security
• Rooted secure sets of trees
• Global secure sets of grid-like graphs
• Parameterized complexity of secure sets
• Computing secure sets in graphs using answer set programming

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)