Deciding Morality of Graphs is NP-complete

by   Tom S. Verma, et al.

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.


Hard and Easy Instances of L-Tromino Tilings

In this work we study tilings of regions in the square lattice with L-sh...

LAYERWIDTH: Analysis of a New Metric for Directed Acyclic Graphs

We analyze a new property of directed acyclic graphs (DAGs), called laye...

An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanation

In a previous paper [Pearl and Verma, 1991] we presented an algorithm fo...

A Generalization of the Directed Graph Layering Problem

The Directed Layering Problem (DLP) solves a step of the widely used lay...

Königsberg Sightseeing: Eulerian Walks in Temporal Graphs

An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits...

The complexity of decomposing a graph into a matching and a bounded linear forest

Deciding whether a graph can be edge-decomposed into a matching and a k-...

Deciding twin-width at most 4 is NP-complete

We show that determining if an n-vertex graph has twin-width at most 4 i...

Please sign up or login with your details

Forgot password? Click here to reset