An Experimental Study of Dynamic Algorithms for Directed Graphs

Authors:
Daniele Frigioni;Tobias Miller;Umberto Nanni;Giulio Pasqualone;Guido Schaefer;Christos D. Zaroliagis
Affiliations:
-;-;-;-;-;-
Venue:
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Year:
1998

Amortized efficiency of a path retrieval data structure

Theoretical Computer Science
Finding paths and deleting edges in directed acyclic graphs

Information Processing Letters
Maintenance of transitive closures and transitive reductions of graphs

Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
LEDA: a platform for combinatorial and geometric computing

Communications of the ACM
On the computational complexity of dynamic graph problems

Theoretical Computer Science
A uniform approach to semi-dynamic problems on digraphs

Theoretical Computer Science - Special issue: graph theoretic concepts in computer science
An empirical study of dynamic graph algorithms

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic output bounded single source shortest path problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic biconnectivity and transitive closure

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Hi-index	0.00