Author:
Serna Maria,Spirakis Paul
Reference13 articles.
1. R. J. Anderson and E. W. Mayr. Approximating P-complete problems. Technical report, Stanford University, 1986.
2. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2–22, 1985.
3. S. Even. Graph Algorithms. Pitman, London, 1979.
4. M. R. Garey and D. S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, 1979.
5. L. M. Goldschlager, R. A. Shaw, and J. Staples. The maximum flow problem is log space complete for P. Theoretical Computer Science, 21:105–111, 1982.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The complexity of the reliable connectivity problem;Mathematical Foundations of Computer Science 1991;1991