Deciding Morality of Graphs is NP-complete

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]

Authors

Thomas Verma

This author has not been identified. Look up 'Thomas Verma' in Google

Judea Pearl

This author has not been identified. Look up 'Judea Pearl' in Google