An experimental study of algorithms for fully dynamic transitive closure

DOI10.1145/1227161.1370597zbMath1365.68511OpenAlexW2026154596MaRDI QIDQ5269272

Ioannis Krommidas, Christos D. 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

reachabilitypathtransitive closuredynamic algorithm

Mathematics Subject Classification ID

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

Related Items (1)

A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time

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