A fully dynamic algorithm for maintaining the transitive closure

DOI10.1145/301250.301380zbMath1345.05102OpenAlexW2044040096MaRDI QIDQ5890868

Valerie King, Garry Sagert

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20)

Related Items (1)

A dynamic topological sort algorithm for directed acyclic graphs

This page was built for publication: A fully dynamic algorithm for maintaining the transitive closure