An experimental study of algorithms for fully dynamic transitive closure

DOI10.1145/1227161.1370597MaRDI QIDQ5269272zbMATH OpenOpenAlexFDO

Authors Ioannis Krommidas, Christos Zaroliagis

Publication date 15 June 2017

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1227161.1370597

zbMATH Keywords

dynamic algorithmpathreachabilitytransitive closure

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Algorithms – ESA 2005
• An experimental study of dynamic algorithms for transitive closure
• Faster fully dynamic transitive closure in practice
• scientific article; zbMATH DE number 2079364
• A faster and simpler fully dynamic transitive closure

Cited in

(13)

• An improved algorithm for transitive closure on acyclic digraphs
• Speeding up dynamic transitive closure for bounded degree graphs
• Incremental and decremental evaluation of transitive closure by first- order queries
• A fully dynamic reachability algorithm for directed graphs with an almost linear update time
• scientific article; zbMATH DE number 1956218 (Why is no real title available?)
• scientific article; zbMATH DE number 2079364 (Why is no real title available?)
• A faster and simpler fully dynamic transitive closure
• An experimental study of dynamic algorithms for transitive closure
• Algorithms – ESA 2005
• Faster fully dynamic transitive closure in practice
• Effective approximation of parametrized closure systems over transactional data streams
• Computing transitive closure on systolic arrays of fixed size
• Mantaining dynamic matrices for fully dynamic transitive closure

This page was built for publication: An experimental study of algorithms for fully dynamic transitive closure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269272)