Abstract
We present the first implementations of certified algorithms for computing dominators, and exhibit their efficiency experimentally on graphs taken from a variety of applications areas. The certified algorithms are obtained by augmenting dominator-finding algorithms to compute a certificate of correctness that is easy to verify. A suitable certificate for dominators is obtained from the concepts of low-high orders and independent spanning trees. Therefore, our implementations provide efficient constructions of these concepts as well, which are interesting in their own right. Furthermore, we present an experimental study of efficient algorithms for computing dominators on large graphs. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Georgiadis, L., Laura, L., Parotsidis, N., & Tarjan, R. E. (2013). Dominator certification and independent spanning trees: An experimental study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7933 LNCS, pp. 284–295). https://doi.org/10.1007/978-3-642-38527-8_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
