Graphs and algorithms
Principles of artificial intelligence
Principles of artificial intelligence
Best first search algorithm in AND/OR graphs with cycles
Journal of Algorithms
Models for dependable computation with multiple inputs and some hardness results
Fundamenta Informaticae
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Using Approximation Hardness to Achieve Dependable Computation
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Hierarchical hippocratic databases with minimal disclosure for virtual organizations
The VLDB Journal — The International Journal on Very Large Data Bases
Minimal disclosure in hierarchical hippocratic databases with delegation
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
| Hi-index | 0.00 |
We will study this problem and present an algorithm for finding the minimum-time-cost solution graph in an AND/OR graph. We will also study the following problems which often appear in industry when using AND/OR graphs to model manufacturing processes or to model problem solving processes: finding maximum (additive and nonadditive) flows and critical vertices in an AND/OR graph. Though there are well known polynomial time algorithms for the corresponding problems in the traditional graph theory, we will show that generally it is NP-hard to find a non-additive maximum flow in an AND/OR graph, and it is both NP-hard and coNP-hard to find a set of critical vertices in an AND/OR graph. We will also present a polynomial time algorithm for finding a maximum additive flow in an AND/OR graph, and discuss the relative complexity of these problems.