Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
From MaRDI portal
This page was built for publication: Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6526707)