Dynamic maintenance of the transitive closure in disjunctive graphs

DOI10.1007/BF01530818zbMath0855.68069OpenAlexW2089821716WikidataQ109585663 ScholiaQ109585663MaRDI QIDQ1924722

Qi Yang, Gaoming Wang, Tracy Pham, Jorge Lobo, Clement Yu

Publication date: 20 October 1996

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01530818

zbMATH Keywords

hypergraphsOR-graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient strategy for non-Horn deductive databases
• Dynamic maintenance of directed hypergraphs
• Directed recursive labelnode hypergraphs: A new representation-language
• Incomplete deductive databases
• Digraph Matrix Analysis
• Minimal Representation of Directed Hypergraphs
• Dynamic Programming as Graph Searching: An Algebraic Approach
• A Theory of Safe Locking Policies in Database Systems
• A modification of Warshall's algorithm for the transitive closure of binary relations

This page was built for publication: Dynamic maintenance of the transitive closure in disjunctive graphs