An Experimental Study of Dynamic Algorithms for Directed Graphs

Academia.edu no longer supports Internet Explorer.

To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.

Log In

Password

Remember me on this computer

or reset password

Enter the email address you signed up with and we'll email you a reset link.

Need an account? Click here to sign up

An Experimental Study of Dynamic Algorithms for Directed Graphs

1998

Christos Zaroliagis

Umberto Nanni

Daniele Frigioni

Abstract

Dynamic graph algorithms maintain a certain property (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 ...

Christos Zaroliagis hasn't uploaded this paper.

Let Christos know you want this paper to be uploaded.

Ask for this paper to be uploaded.

People also downloaded these PDFs