search for: dominac

...quot;, however enriched with ideas from "The Refined Process Structure Tree - Jussi Vanhatalo, Hagen Voelyer, Jana Koehler - 2009". The algorithm to calculate these data structures however is completely different, as it takes advantage of existing information already available in (Post)dominace tree and dominance frontier passes. This leads to a simpler and in practice hopefully better performing algorithm. The runtime of the algorithms described in the paper above are both linear in graph size, O(V+E), whereas this algorithm is probably in O(V+E^2) in the worst case, as the dominanc...