DAG-Width Calculator

directed graph width

All Tools

Loading tool...

About DAG-Width Calculator

A DAG-width calculator computing dagw(G): width of optimal DAG decomposition for digraphs. Generalizes treewidth to directed graphs via DAG structure. dagw = 1 iff acyclic. Obdržálek (2006). Parity games solvable in O(n^(dagw+1)). Client-side.

DAG-Width Calculator Features

  • dagw(G)
  • Directed
  • DAG=1
  • Parity games
  • Common digraphs
Advertisement
Advertisement