Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs (Q6526707)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs |
scientific article from arXiv |
Statements
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs (English)
0 references
