License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2019.50
URN: urn:nbn:de:0030-drops-111715
URL: http://drops.dagstuhl.de/opus/volltexte/2019/11171/
Go to the corresponding LIPIcs Volume Portal


Georgiadis, Loukas ; Giannis, Konstantinos ; Italiano, Giuseppe F. ; Karanasiou, Aikaterini ; Laura, Luigi

Dynamic Dominators and Low-High Orders in DAGs

pdf-format:
LIPIcs-ESA-2019-50.pdf (0.7 MB)


Abstract

We consider practical algorithms for maintaining the dominator tree and a low-high order in directed acyclic graphs (DAGs) subject to dynamic operations. Let G be a directed graph with a distinguished start vertex s. The dominator tree D of G is a tree rooted at s, such that a vertex v is an ancestor of a vertex w if and only if all paths from s to w in G include v. The dominator tree is a central tool in program optimization and code generation, and has many applications in other diverse areas including constraint programming, circuit testing, biology, and in algorithms for graph connectivity problems. A low-high order of G is a preorder of D that certifies the correctness of D, and has further applications in connectivity and path-determination problems. We first provide a practical and carefully engineered version of a recent algorithm [ICALP 2017] for maintaining the dominator tree of a DAG through a sequence of edge deletions. The algorithm runs in O(mn) total time and O(m) space, where n is the number of vertices and m is the number of edges before any deletion. In addition, we present a new algorithm that maintains a low-high order of a DAG under edge deletions within the same bounds. Both results extend to the case of reducible graphs (a class that includes DAGs). Furthermore, we present a fully dynamic algorithm for maintaining the dominator tree of a DAG under an intermixed sequence of edge insertions and deletions. Although it does not maintain the O(mn) worst-case bound of the decremental algorithm, our experiments highlight that the fully dynamic algorithm performs very well in practice. Finally, we study the practical efficiency of all our algorithms by conducting an extensive experimental study on real-world and synthetic graphs.

BibTeX - Entry

@InProceedings{georgiadis_et_al:LIPIcs:2019:11171,
  author =	{Loukas Georgiadis and Konstantinos Giannis and Giuseppe F. Italiano and Aikaterini Karanasiou and Luigi Laura},
  title =	{{Dynamic Dominators and Low-High Orders in DAGs}},
  booktitle =	{27th Annual European Symposium on Algorithms (ESA 2019)},
  pages =	{50:1--50:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-124-5},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{144},
  editor =	{Michael A. Bender and Ola Svensson and Grzegorz Herman},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11171},
  URN =		{urn:nbn:de:0030-drops-111715},
  doi =		{10.4230/LIPIcs.ESA.2019.50},
  annote =	{Keywords: Connectivity, dominators, low-high orders}
}

Keywords: Connectivity, dominators, low-high orders
Seminar: 27th Annual European Symposium on Algorithms (ESA 2019)
Issue Date: 2019
Date of publication: 06.09.2019


DROPS-Home | Imprint | Privacy Published by LZI