A uniform approach to semi-dynamic problems on digraphs

Authors:
Serafino Cicerone;Daniele Frigioni;Umberto Nanni;Francesco Pugliese
Affiliations:
Univ. di L'Aquila, L'Aquila, Italy;Univ. di L'Aquila, L'Aquila, Italy/ and Univ. di Roma “/La Sapienza”/, Rome, Italy;Univ. di Roma “/La Sapienza”/, Rome, Italy;Telecom Italia DG, Rome, Italy
Venue:
Theoretical Computer Science - Special issue: graph theoretic concepts in computer science
Year:
1998

Citing 0
Cited 7

Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
An Experimental Study of Dynamic Algorithms for Directed Graphs

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Implementations and experimental studies of dynamic graph algorithms

Experimental algorithmics
An Experimental Study of Dynamic Algorithms for Transitive Closure

Journal of Experimental Algorithmics (JEA)
Average-case analysis of incremental topological ordering

Discrete Applied Mathematics
Average-case analysis of online topological ordering

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
An experimental study of dynamic dominators

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract