Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"graph protection"”.

  1. Approximation Algorithms for Graph Protection Problems

    We study a budgeted cut problem known as Graph Protection, where the goal is to remove edges of a given graph in order to protect valuable nodes from stochastic, infectious threats. This problem was recently proposed by Shmoys and Spencer to model challenges associated with wildfire prevention when …

    waterloo Repository record for Approximation Algorithms for Graph Protection Problems (opens in a new tab)

  2. Secure and Efficient In-Process Monitor and Multi-Variant Execution

    … hardware assisted in-process monitor protection system utilizing Intel Memory Protection Keys (MPK) to enforce execute-only memory, combined with code randomization and runtime binary patching to effectively protect and hide in-process monitors. Next, we introduce L-MVX, a flexible …

    vt Repository record for Secure and Efficient In-Process Monitor and Multi-Variant Execution (opens in a new tab)

  3. Mobile Guards’ Strategies for Graph Surveillance and Protection

    … to any sequence of attacks on an n-vertex graph G in both games. We show that this decision problem is EXPTIME-complete when neither G nor k is fixed, and when the initial configuration of the guards is given in both cases. We further show that in the case of the eternal domination game, if …

    uvic Repository record for Mobile Guards’ Strategies for Graph Surveillance and Protection (opens in a new tab)