Login / Signup
Distilling critical attack graph surface iteratively through minimum-cost SAT solving.
Heqing Huang
Su Zhang
Xinming Ou
Atul Prakash
Karem A. Sakallah
Published in:
ACSAC (2011)
Keyphrases
</>
minimum cost
sat solving
attack graph
np hard
attack graphs
approximation algorithms
sat solvers
network flow
network flow problem
boolean satisfiability
sat problem
network configuration
medical images
search strategies