Advertisement

Maximum Flows and Critical Vertices in AND/OR Graphs

Extended Abstract
  • Yvo Desmedt
  • Yongge Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2387)

Abstract

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.

Keywords

Polynomial Time Maximum Flow Polynomial Time Algorithm Incoming Edge Solution Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    C. L. Chang and J. R. Slagle. An admissible and optimal algorithm for searching AND/OR graphs. Artificial Intelligence, 2:117–128, 1971.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    L.R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.zbMATHGoogle Scholar
  4. 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
  5. 5.
    M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons Ltd., New York, 1984.zbMATHGoogle Scholar
  6. 6.
    D. Hvalica. Best first search algorithm in AND/OR graphs with cycles. J. of Algorithms, 21:102–110, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 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. 8.
    N. J. Nilsson. Principles of Artificial Intelligence. Tioga, 1980.Google Scholar
  9. 9.
    S. Sahni. Computationally related problems. SIAM J. Comput., 3:262–279, 1974.CrossRefMathSciNetGoogle Scholar
  10. 10.
    Y. Wang, Y. Desmedt, and M. Burmester. NP-Hardness of dependable computation with multiple inputs. Fundamenta Informaticae, 42(1):61–73, 2000.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Yvo Desmedt
    • 1
    • 2
  • Yongge Wang
    • 3
  1. 1.Computer ScienceFlorida State UniversityTallahasseeUSA
  2. 2.Department of Mathematics, Royal HollowayUniversity of LondonUK
  3. 3.Department of Software and Information SystemsUniversity of North Carolina at CharlotteCharlotte

Personalised recommendations