AI Chat AI Image Generator AI Video Text to Speech

Deciding Morality of Graphs is NP-complete

03/06/2013

∙

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.

Tom S. Verma
5 publications
Judea Pearl
53 publications

research

∙ 10/12/2017

Hard and Easy Instances of L-Tromino Tilings

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

0 Javier T. Akagi, et al. ∙

research

∙ 10/19/2012

LAYERWIDTH: Analysis of a New Metric for Directed Acyclic Graphs

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

0 Mark Hopkins, et al. ∙

research

∙ 03/13/2013

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

0 Tom S. Verma, et al. ∙

research

∙ 08/28/2016

A Generalization of the Directed Graph Layering Problem

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

0 Ulf Rüegg, et al. ∙

research

∙ 03/12/2021

Königsberg Sightseeing: Eulerian Walks in Temporal Graphs

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

0 Andrea Marino, et al. ∙

research

∙ 04/06/2023

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

0 Agnijo Banerjee, et al. ∙

research

∙ 12/16/2021

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

0 Pierre Bergé, et al. ∙