
Hard and Easy Instances of LTromino Tilings
In this work we study tilings of regions in the square lattice with Lsh...
read it

LAYERWIDTH: Analysis of a New Metric for Directed Acyclic Graphs
We analyze a new property of directed acyclic graphs (DAGs), called laye...
read it

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

A Generalization of the Directed Graph Layering Problem
The Directed Layering Problem (DLP) solves a step of the widely used lay...
read it

On the inversion number of oriented graphs
Let D be an oriented graph. The inversion of a set X of vertices in D co...
read it

Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits...
read it

Transforming graph states to Bellpairs is NPComplete
Critical to the construction of large scale quantum networks, i.e. a qua...
read it
Deciding Morality of Graphs is NPcomplete
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 NPcomplete.
READ FULL TEXT
Comments
There are no comments yet.