Dominators in Directed Graphs : A Survey of Recent Results , Applications , and Open Problems

@inproceedings{Georgiadis2013DominatorsID,
  title={Dominators in Directed Graphs : A Survey of Recent Results , Applications , and Open Problems},
  author={Loukas Georgiadis and Nikos Parotsidis},
  year={2013}
}
The computation of dominators is a central tool in program optimization and code generation, and it has applications in other diverse areas including constraint programming, circuit testing, and biology. In this paper we survey recent results, applications, and open problems related to the notion of dominators in directed graphs, including dominator verification and certification, computing independent spanning trees, and connectivity and path-determination problems in directed graphs.