2011 15th Panhellenic Conference on Informatics (2011)
Sept. 30, 2011 to Oct. 2, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCI.2011.28
We consider the problem of dynamically maintaining a dominator tree of a flow graph, through a sequence of arc updates (insertions and deletions). We propose a new algorithm for this problem, which is based on the static dominators algorithm of Lengauer and Tarjan. Although the worst case complexity of a single update matches the running time of Lengauer-Tarjan, we exhibit the efficiency of our algorithm in practice.
algorithms, data structures, graphs, program optimization
L. Georgiadis, K. Patakakis and V. A. Tatsis, "Dynamic Dominators in Practice," 2011 15th Panhellenic Conference on Informatics(PCI), Kastoria, Greece, 2011, pp. 100-104.