Author:
Cao Yi,Culberson Joseph,Stewart Lorna
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Abbas, N., Culberson, J., Stewart, L.: Recognizing maximal unfrozen graphs with respect to independent sets is coNP-complete. Discrete Mathematics & Theoretical Computer Science 7(1), 141–154 (2005)
2. Beacham, A., Culberson, J.: On the complexity of unfrozen problems. Discrete Applied Mathematics 153(1-3), 3–24 (2005)
3. Cai, J.-Y., Meyer, G.E.: Graph minimal uncolorability is DP-complete. SIAM Journal on Computing 16(2), 259–277 (1987)
4. Lecture Notes in Computer Science;J. Cai,1987
5. Cheng, Y., Ko, K.-I., Wu, W.: On the complexity of non-unique probe selection. Theoretical Computer Science 390(1), 120–125 (2008)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献