[1] |
Even, S.; Goldreich, O.; Tong, P., On the NP-completeness of certain network-testing problems, (Tech. Rept. #230 (1981), Dept. of Computer Science: Dept. of Computer Science Technion, Haifa, Israel) · Zbl 0532.94017 |
[2] |
Garey, M. R.; Johnson, D. S., Computers and Intractability, (A Guide to the Theory of NP-completeness (1979), Freeman: Freeman San Francisco) · Zbl 0369.90053 |
[3] |
Garey, M. R.; Johnson, D. S.; Stockmeyer, L. J., Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1, 237-267 (1976) · Zbl 0338.05120 |
[4] |
Micali, S.; Vazirani, V. V., An \(O(|V|12.|E|)\) algorithm for finding maximum matching in general graphs, Proc. 21st Ann. IEEE Symp. on Foundations of Computer Science, 17-27 (1980) |
[5] |
Schaefer, T. J., The complexity of satisfiability problems, Proc. 10th Ann. ACM Symp. on Theory of Computing, 216-226 (1978) · Zbl 1282.68143 |