Maximum Flows and Critical Vertices in AND/OR Graphs
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 non-additive) 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.
KeywordsPolynomial Time Maximum Flow Polynomial Time Algorithm Incoming Edge Solution Graph
Unable to display preview. Download preview PDF.
- 1.M. Burmester, Y. Desmedt, and Y. Wang. Using approximation hardness to achieve dependable computation. In: Proc. RANDOM’ 98, pages 172–186. LNCS 1518, Springer Verlag, 1998.Google Scholar
- 4.M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, 1979.Google Scholar
- 7.A. Martelli and U. Montanari. Additive AND/OR graphs. In Proceedings of the Third International Joint Conference on Artificial Intelligence, pages 1–11, Morgan Kaufmann Publishers, Inc., 1973.Google Scholar
- 8.N. J. Nilsson. Principles of Artificial Intelligence. Tioga, 1980.Google Scholar