Deciding Morality of Graphs is NP-complete
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
Mar-6-2013
- Country:
- North America > United States
- Florida > Broward County
- Fort Lauderdale (0.04)
- California
- Los Angeles County > Los Angeles (0.14)
- San Mateo County > San Mateo (0.05)
- Santa Clara County > Stanford (0.04)
- Florida > Broward County
- Europe
- United Kingdom > England (0.04)
- Italy (0.04)
- Germany > Rheinland-Pfalz
- Mainz (0.04)
- North America > United States
- Genre:
- Research Report (0.40)