Author:
Krokhin Andrei,Jeavons Peter,Jonsson Peter
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7 (1974) 95–132
2. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
3. Lect Notes Comput Sci;O. Angelsmark,2000
4. Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185–204
5. Schaefer, T.: The complexity of satisfiability problems. In: Proceedings of the 10th Symposium on the Theory of Computing (STOC’78), New-York, ACM Press (1978) 216–226
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Integral Mixed Unit Interval Graphs;Lecture Notes in Computer Science;2012