Deciding Morality of Graphs is NP-complete

📝 Original Info

• Title: Deciding Morality of Graphs is NP-complete
• ArXiv ID: 1303.1501
• Date: 2013-03-08
• Authors: Researchers from original ArXiv paper

📝 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.

💡 Deep Analysis

Deep Dive into Deciding Morality of Graphs is NP-complete.

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.

📄 Full Content

Reference