A First Experimental Study of a Dynamic Transitive Closure Algorithm.pdfVIP

A First Exp erimental Study of a Dynamic Transitive Closure Algorithm Tobias Miller and Christos D Zaroliagis 1 MaxPlanckInstitut f ur Informatik Im Stadtwald D Saarbr ucken Germany email fmillerzaro gmpisbmpgde ABSTRACT We describ e an implementation of Italianos partially dynamic data structure for maintaining transitive closure information in a directed graph and rep ort on exp erimental results with ran dom directed graphs and random sequences of op erations The op erations supp orted are edge insertions or edge deletions and queries For the case of edge deletions the directed graph is assumed to b e acyclic Intro duction Dynamic graph algorithms maintain a certain prop erty eg connectivity of a graph that changes dynamically over time Typical changes include insertion of a new edge and deletion of an existing edge The challenge for a dynamic algorithm is to maintain in an environment of dynamic changes the desired graph prop erty eciently ie without recomputing everything from scratch after a dynamic change Dynamic graph algorithms have b een an active and blossoming eld over the last years A numb er of imp ortant theoretical results esp ecially for undirected graphs have b een achieved and recently an equally imp ortant eort has started on implementing these techniques and showing their practical merits These were the rst implementations concerning dynamic maintenance of certain prop erties connectivity minimum spanning tree in undirected graphs as well as the rst implementation of sparsication a technique for sp eeding up d