Dynamic maintenance of the transitive closure in disjunctive graphs
From MaRDI portal
Publication:1924722
Recommendations
- scientific article; zbMATH DE number 2080476
- scientific article; zbMATH DE number 4083002
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- Maintaining transitive closure in first order after node-set and edge-set deletions
- Speeding up dynamic transitive closure for bounded degree graphs
Cites work
- A modification of Warshall's algorithm for the transitive closure of binary relations
- A Theory of Safe Locking Policies in Database Systems
- An efficient strategy for non-Horn deductive databases
- Digraph Matrix Analysis
- Directed recursive labelnode hypergraphs: A new representation-language
- Dynamic maintenance of directed hypergraphs
- Dynamic Programming as Graph Searching: An Algebraic Approach
- scientific article; zbMATH DE number 88998 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Incomplete deductive databases
- Minimal Representation of Directed Hypergraphs
Cited in
(5)- Maintaining regular properties dynamically in k-terminal graphs
- An efficient database transitive closure algorithm
- Maintaining transitive closure in first order after node-set and edge-set deletions
- Generalized core maintenance of dynamic bipartite graphs
- Mantaining dynamic matrices for fully dynamic transitive closure
This page was built for publication: Dynamic maintenance of the transitive closure in disjunctive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924722)
