A faster and simpler fully dynamic transitive closure

DOI10.1145/1328911.1328917zbMATH Open1446.68122OpenAlexW1997898455MaRDI QIDQ4962698

Liam Roditty

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

reachabilitydirected graphdynamic graph algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Unnamed Item ⋮ Mantaining dynamic matrices for fully dynamic transitive closure

Recommendations

• Unnamed Item 👍 👎
• Fast dynamic transitive closure with lookahead 👍 👎
• Efficient computation of transitive closures 👍 👎
• Cache-Friendly implementations of transitive closure 👍 👎
• An experimental study of algorithms for fully dynamic transitive closure 👍 👎
• An Experimental Study of Dynamic Algorithms for Transitive Closure 👍 👎
• Algorithms – ESA 2005 👍 👎
• A fully dynamic algorithm for maintaining the transitive closure 👍 👎
• A fully dynamic algorithm for maintaining the transitive closure 👍 👎
• Faster fully dynamic transitive closure in practice 👍 👎

This page was built for publication: A faster and simpler fully dynamic transitive closure