works on
graph modifications 1orchard networks 1phylogenetic networks 1proximity measures 1tree-based networks 1tree-child networks 1

From the 1 of 7 linked papers with an AI index.

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2026

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs

Niels Holtgrefe, Leo van Iersel, Mark Jones

To measure the tree-likeness of a directed acyclic graph (DAG), a new width parameter that considers the directions of the arcs was recently introduced: scanwidth. We present the f…