Deciding Morality of Graphs is NP-complete
Artificial Intelligence
2013-03-08 v1
Abstract
In order to find a causal explanation for data presented in the form of covariance and concentration matrices it is necessary to decide if the graph formed by such associations is a projection of a directed acyclic graph (dag). We show that the general problem of deciding whether such a dag exists is NP-complete.
Keywords
Cite
@article{arxiv.1303.1501,
title = {Deciding Morality of Graphs is NP-complete},
author = {Tom S. Verma and Judea Pearl},
journal= {arXiv preprint arXiv:1303.1501},
year = {2013}
}
Comments
Appears in Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence (UAI1993)