Addendum to "Dominator Tree Certification and Divergent Spanning Trees"

@article{Georgiadis2016AddendumT,
  title={Addendum to "Dominator Tree Certification and Divergent Spanning Trees"},
  author={Loukas Georgiadis and Robert E. Tarjan},
  journal={ACM Trans. Algorithms},
  year={2016},
  volume={12},
  pages={56:1-56:3}
}
In this addendum to “Dominator Tree Certification and Divergent Spanning Trees” [Georgiadis and Tarjan 2015], we present an application of low-high orders in faulttolerant network design that we discovered recently. A flow graph is a directed graph G with a designated start vertex s such that every vertex is reachable from s. A vertex v dominates a vertex w if v is on every path from s to w. The dominator relation defines a dominator tree D such that v dominates w if and only if v is an… CONTINUE READING