Active Graph Reachability Reduction for Network Security and Software Engineering

Motivated by applications from computer network security and software engineering, we study the problem of reducing reachability on a graph with unknown edge costs. When the costs are known, reachability reduction can be solved using a linear relaxation of sparsest cut. Problems arise, however, when edge costs are unknown. In this case, blindly applying sparsest cut with incorrect edge costs can result in suboptimal or infeasible solutions. Instead, we propose to solve the problem via edge classification using feedback on individual edges. We show that this approach outperforms competing approaches in accuracy and efficiency on our target applications.

Authors

• Alice X. Zheng
• John Dunagan
• Ashish Kapoor Microsoft Research

Keywords

No keywords are indexed for this paper.