Login / Signup
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs.
Steven Noel
Sushil Jajodia
Brian O'Berry
Michael Jacobs
Published in:
ACSAC (2003)
Keyphrases
</>
minimum cost
dependency graphs
network flow
network flow problem
spanning tree
np hard
approximation algorithms
capacity constraints
network simplex algorithm
minimum cost path
data structure
worst case
peer to peer
complex networks
communication networks
network design problem