• DocumentCode
    2136880
  • Title

    Dynamic Dominators in Practice

  • Author

    Patakakis, Konstantinos ; Georgiadis, Loukas ; Tatsis, Vasileios A.

  • Author_Institution
    Dept. of Inf. & Tel. Eng., Univ. of Western Macedonia, Kozani, Greece
  • fYear
    2011
  • fDate
    Sept. 30 2011-Oct. 2 2011
  • Firstpage
    100
  • Lastpage
    104
  • Abstract
    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.
  • Keywords
    computational complexity; flow graphs; directed graph; dominator tree; dynamic dominators; flow graph; static dominators algorithm; worst case complexity; Algorithm design and analysis; Approximation algorithms; Computer languages; Equations; Heuristic algorithms; Iterative methods; Testing; algorithms; data structures; graphs; program optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Informatics (PCI), 2011 15th Panhellenic Conference on
  • Conference_Location
    Kastonia
  • Print_ISBN
    978-1-61284-962-1
  • Type

    conf

  • DOI
    10.1109/PCI.2011.28
  • Filename
    6065072
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2136880