Dynamic maintenance of directed hypergraphs

DOI10.1016/0304-3975(90)90030-LzbMath0699.68027WikidataQ61609675 ScholiaQ61609675MaRDI QIDQ913481

Giuseppe F. Italiano, Umberto Nanni, Giorgio Ausiello

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

hypergraphs; data structure; on-line maintenance

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C65: Hypergraphs

68R10: Graph theory (including graph drawing) in computer science

68P05: Data structures

Related Items

Linear time analysis of properties of conflict-free and general Petri nets, On-line algorithms for satisfiability problems with uncertainty, Reconstructing a history of recombinations from a set of sequences, A hypergraph model for constraint logic programming and applications to bus drivers' scheduling, Max Horn SAT and the minimum cut problem in directed hypergraphs, Partially dynamic maintenance of minimum weight hyperpaths, Directed hypergraphs and applications, Dynamic maintenance of the transitive closure in disjunctive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Amortized efficiency of a path retrieval data structure
• Directed recursive labelnode hypergraphs: A new representation-language
• A data structure for dynamic trees
• On the computational power of pushdown automata
• Organization and maintenance of large ordered indexes
• Graph Algorithms for Functional Dependency Manipulation
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Amortized Computational Complexity
• Minimal Representation of Directed Hypergraphs
• An On-Line Edge-Deletion Problem
• Dynamic Programming as Graph Searching: An Algebraic Approach
• A Theory of Safe Locking Policies in Database Systems
• On-line algorithms for polynomially solvable satisfiability problems
• The Transitive Reduction of a Directed Graph