Thomas Verma, Judea Pearl. Deciding Morality of Graphs is NP-complete. In David Heckerman, E. H. Mamdani, editors, UAI 93: Proceedings of the Ninth Annual Conference on Uncertainty in Artificial Intelligence, July 9-11, 1993, The Catholic University of America, Providence, Washington, DC, USA. pages 391-399, Morgan Kaufmann, 1993. [doi]
@inproceedings{VermaP93,
title = {Deciding Morality of Graphs is NP-complete},
author = {Thomas Verma and Judea Pearl},
year = {1993},
url = {http://rome.exp.sis.pitt.edu/UAI/Abstract.asp?articleID=604&proceedingID=9},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/VermaP93},
cites = {0},
citedby = {0},
pages = {391-399},
booktitle = {UAI 93: Proceedings of the Ninth Annual Conference on Uncertainty in Artificial Intelligence, July 9-11, 1993, The Catholic University of America, Providence, Washington, DC, USA},
editor = {David Heckerman and E. H. Mamdani},
publisher = {Morgan Kaufmann},
}