LAYERWIDTH: analysis of a new metric for directed acyclic graphs

  • Authors:

  • Mark Hopkins

  • Affiliations:

  • Department of Computer Science, University of California, Los Angeles, Los Angeles, CA

  • Venue:
  • UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a useful class of DAGs proposed by Eiter and Lukasiewicz for tractable causal reasoning. First, we establish that the complexity of deciding whether a given graph has a bounded layerwidth is NP-complete. Then we proceed to prove key properties of layerwidth that are helpful in efficiently computing the optimal layerwidth. Finally, we compare this new DAG property to two other important DAG properties: treewidth and bandwidth.