Author:
Bliem Bernhard,Woltran Stefan
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Woltran, S.: Computing secure sets in graphs using answer set programming. In: Proceedings of ASPOCP 2014 (2014)
2. Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)
3. Brigham, R.C., Dutton, R.D., Hedetniemi, S.T.: Security in graphs. Discrete Appl. Math. 155(13), 1708–1714 (2007)
4. de Haan, R., Szeider, S.: The parameterized complexity of reasoning problems beyond NP. In: Proceedings of KR 2014, pp. 82–91 (2014)
5. Enciso, R.I., Dutton, R.D.: Parameterized complexity of secure sets. Congr. Numer. 189, 161–168 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Complexity of Secure Sets;Algorithmica;2017-08-14