The Dynamic Complexity of Transitive Closure Is In DynTC0
نویسنده
چکیده
This paper presents a fully dynamic algorithm for maintaining the transitive closure of a binary relation. All updates and queries can be computed by constant depth threshold circuits of polynomial size (TC circuits). This places dynamic transitive closure in the dynamic complexity class DynTC, and implies that transitive closure can be maintained in database systems that include first-order update queries and aggregation operators, using a database with size polynomial in the size of the relation.
منابع مشابه
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملFully Dynamic Transitive Closure in Plane Dags with One Source and One Sink
We give an algorithm for the Dynamic Transitive Closure Problem for planar directed acyclic graphs with one source and one sink. The graph can be updated in logarithmic time under arbitrary edge insertions and deletions that preserve the embedding. Queries of the form ‘is there a directed path from u to v?’ for arbitrary vertices u and v can be answered in logarithmic time. The size of the data...
متن کاملFully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier
In this paper we introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure. In particular, we devise a deterministic algorithm for general directed graphs that achieves O(n2) amortized time for updates, while preserving unit wors...
متن کاملComputational Complexity of Dynamic Problems
This progress report surveys some of my scientiic work on part A of the Ph.D.-programme at the Computer Science Department of the University of Aarhus. I give a survey-like introduction to the eld of Complexity Theory to which my results bear relevance. I give a general account of my contributions to the eld, including the the Dynamic Transitive Closure Problem for spherical st-graphs, the Dyna...
متن کاملParallel Implementation of Italiano's Incremental Algorithm for Dynamic Updating the Transitive Closure
The transitive closure (or reachability) problem in a directed graph consists in finding whether there is a path between any two vertices. In this paper, we first study the problem of parallelization of Italiano's algorithm for dynamic updating the transitive closure after inserting a new arc into the graph represented as a list of arcs. To this end, by means of the data structure first propose...
متن کامل