A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Faster Fully Dynamic Transitive Closure in Practice
2020
Symposium on Experimental and Efficient Algorithms
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions. The problem has been thoroughly investigated in theory and many specialized algorithms for solving it have been proposed in the last decades. In two large studies [Frigioni ea, 2001; Krommidas and Zaroliagis, 2008], a number of these algorithms have been evaluated experimentally
doi:10.4230/lipics.sea.2020.14
dblp:conf/wea/HanauerH020
fatcat:upqg4kcgmjewfjbx4qaeft6dve