We propose an approach with feasible space requirement to maintain the transitive closure of a class of hypergraphs called OR-graphs.
Dynamic maintenance of the transitive closure in disjunctive graphs
link.springer.com › content › pdf
We propose an approach with feasible space requirement to maintain the transitive closure of a class of hypergraphs called OR-graphs.
Jorge Lobo , Qi Yang, Clement T. Yu: Dynamic Maintenance of the Transitive Closure in Disjunctive Graphs. Ann. Math. Artif. Intell. 14(2-4): 151-176 (1995).
Title: Dynamic Maintenance of the Transitive Closure in Disjunctive Graphs ; Authors: Lobo J.; Yang Q.; Yu C.; Wang G.; Pham T. ; Researchers (PRC):, Lobo, Jorge.
Abstract We propose an approach with feasible space requirement to maintain the transitive closure of a class of hypergraphs called OR-graphs. OR-graphs are ...
Describe an efficient algorithm for updating the transitive closure as edges are inserted into the graph.
Missing: Maintenance Disjunctive
We propose an approach with feasible space requirement to maintain the transitive closure of a class of hypergraphs called OR-graphs. OR-graphs are equivalent ...
This paper presents an efficient fully dynamic graph algorithm for maintaining the transitive closure of a directed graph. The algorithm updates the ...
Missing: Disjunctive | Show results with:Disjunctive
Dynamic Maintenance of the Transitive Closure in Disjunctive Graphs. Autors: Lobo J.; Yang Q.; Yu C.; Wang G.; Pham T. Investigadors/es (PRC):, Lobo, Jorge.
This paper presents an e cient fully dynamic graph algorithm for maintaining the transitive closure of a directed graph. The algorithm updates the adjacency ...
Missing: Disjunctive | Show results with:Disjunctive