Complexity of eternal security

MaRDI QIDQ5442507zbMATH OpenFDO

Authors William F. Klostermeyer

Publication date 22 February 2008

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2174620
• Complexity of secure sets
• Maximum-demand graphs for eternal security
• Eternally secure sets, independence sets and cliques
• scientific article; zbMATH DE number 5968475

Cited in

(5)

• Eternal dominating sets on digraphs and orientations of graphs
• The guarding game is E-complete
• Eternal domination and clique covering
• Eternal distance-k domination on graphs
• Guard games on graphs: keep the intruder out!

This page was built for publication: Complexity of eternal security

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