z-logo
open-access-imgOpen Access
Complexity of Optimally Defending and Attacking a Network
Author(s) -
Kamran Najeebullah
Publication year - 2018
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v32i1.11354
Subject(s) - parameterized complexity , geodesic , vertex (graph theory) , combinatorics , focus (optics) , graph , inverse , computer science , metric (unit) , computational complexity theory , mathematics , discrete mathematics , theoretical computer science , algorithm , physics , geometry , operations management , optics , economics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom