Dynamic maintenance of directed hypergraphs
- 1 May 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 72 (2-3) , 97-117
- https://doi.org/10.1016/0304-3975(90)90030-l
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CC -86-05353, DCR-85-11713)
This publication has 12 references indexed in Scilit:
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Graph Algorithms for Functional Dependency ManipulationJournal of the ACM, 1983
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- A Theory of Safe Locking Policies in Database SystemsJournal of the ACM, 1982
- Dynamic Programming as Graph Searching: An Algebraic ApproachJournal of the ACM, 1981
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Directed recursive labelnode hypergraphs: A new representation-languageArtificial Intelligence, 1977
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972