Fully Dynamic Transitive Closure Algorithms: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:1302:13, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,918 bytes +1,918‎ Created page with "Title: Fully Dynamic Transitive Closure Algorithms Research Question: How can we efficiently maintain the transitive closure of a dynamic graph under a sequence of insertion and deletion operations? Methodology: The researchers proposed a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. This approach allows them to improve the best known bounds for fully dynamic transitive closure. They designed..."
Retrieved from "https://simplesci.org/wiki/Fully_Dynamic_Transitive_Closure_Algorithms"