Artificial Intelligence
Minimal representation of directed hypergraphs
SIAM Journal on Computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Introduction to algorithms
Dynamic maintenance of directed hypergraphs
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
Hyperpaths and shortest hyperpaths
COMO '86 Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization
On-line algorithms for polynomially solvable satisfiability problems
Journal of Logic Programming
Directed hypergraphs and applications
Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
A unified approach for deciding the existence of certain Petri net paths
Information and Computation
Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
On-line algorithms for satisfiability problems with uncertainty
Selected papers from the international workshop on Uncertainty in databases and deductive systems
Mathematical Programming: Series A and B
Abductive theories in artificial intelligence
Principles of knowledge representation
Max Horn SAT and the minimum cut problem in directed hypergraphs
Mathematical Programming: Series A and B
Dynamic Programming as Graph Searching: An Algebraic Approach
Journal of the ACM (JACM)
Graph Algorithms for Functional Dependency Manipulation
Journal of the ACM (JACM)
Principles of Database Systems
Principles of Database Systems
Connections in acyclic hypergraphs: extended abstract
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
IEA/AIE '98 Proceedings of the 11th international conference on Industrial and engineering applications of artificial intelligence and expert systems: methodology and tools in knowledge-based systems
Graphs and Hypergraphs
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Operations Research Letters
The complexity of arc-colorings for directed hypergraphs
Discrete Applied Mathematics
Hierarchical hippocratic databases with minimal disclosure for virtual organizations
The VLDB Journal — The International Journal on Very Large Data Bases
An algorithm for the appraisal of assurance indicators for complex business processes
Proceedings of the 2007 ACM workshop on Quality of protection
Minimal disclosure in hierarchical hippocratic databases with delegation
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Complexity of linear connectivity problems in directed hypergraphs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Finding the K shortest hyperpaths using reoptimization
Operations Research Letters
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
The purpose of this paper is twofold. First, we review several basic combinatorial problems that have been stated in terms of directed hypergraphs and have been studied in the literature in the framework of different application domains. Among them, transitive closure, transitive reduction, flow and cut problems, and minimum weight traversal problems. For such problems we illustrate some of the most important algorithmic results in the context of both static and dynamic applications. Second, we address a specific dynamic problem which finds several interesting applications, especially in the framework of knowledge representation: the maintenance of minimum weight hyperpaths under hyperarc weight increases and hyperarc deletions. For such problem we provide a new efficient algorithm applicable for a wide class of hyperpath weight measures.