Dynamic maintenance of directed hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432746 (Why is no real title available?)
- scientific article; zbMATH DE number 3839362 (Why is no real title available?)
- scientific article; zbMATH DE number 4083002 (Why is no real title available?)
- scientific article; zbMATH DE number 3664336 (Why is no real title available?)
- scientific article; zbMATH DE number 3744581 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3895108 (Why is no real title available?)
- A Theory of Safe Locking Policies in Database Systems
- A data structure for dynamic trees
- Amortized Computational Complexity
- Amortized efficiency of a path retrieval data structure
- An On-Line Edge-Deletion Problem
- Directed recursive labelnode hypergraphs: A new representation-language
- Dynamic Programming as Graph Searching: An Algebraic Approach
- Graph Algorithms for Functional Dependency Manipulation
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Minimal Representation of Directed Hypergraphs
- On the computational power of pushdown automata
- On-line algorithms for polynomially solvable satisfiability problems
- Organization and maintenance of large ordered indexes
- The Transitive Reduction of a Directed Graph
Cited in
(19)- Generalized core maintenance of dynamic bipartite graphs
- On the complexity of strongly connected components in directed hypergraphs
- Max Horn SAT and the minimum cut problem in directed hypergraphs
- Association Rules Network: Definition and Applications
- Partially dynamic maintenance of minimum weight hyperpaths
- Dynamic maintenance of planar digraphs, with applications
- Dynamic maintenance of the transitive closure in disjunctive graphs
- Directed hypergraphs and applications
- Reconstructing a history of recombinations from a set of sequences
- Computing shortest hyperpaths for pathway inference in cellular reaction networks
- Maintaining regular properties dynamically in k-terminal graphs
- On persistent directed graphs
- Certain concepts of bipolar fuzzy directed hypergraphs
- A hypergraph model for constraint logic programming and applications to bus drivers' scheduling
- scientific article; zbMATH DE number 2044509 (Why is no real title available?)
- scientific article; zbMATH DE number 4057024 (Why is no real title available?)
- On-line algorithms for satisfiability problems with uncertainty
- Linear time analysis of properties of conflict-free and general Petri nets
- On-line algorithms for satisfiability problems with uncertainty
This page was built for publication: Dynamic maintenance of directed hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913481)
