Corrigendum
Corrections to “Finding dominators via disjoint set union” [J. Discrete Algorithms 23 (2013) 2–20]

https://doi.org/10.1016/j.jda.2014.01.002
Under an Elsevier user license
open archive

Keywords

Depth-first search
Directed graph
Disjoint set union
Dominators
Flow graph
Global code optimization
Program certification

Cited by (0)

1

Research at Princeton University partially supported by NSF grant CCF-0832797.

Copyright © 2014 Elsevier B.V. All rights reserved.