Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings (Q2957884)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings |
scientific article |
Statements
30 January 2017
0 references
semi-complete digraph
0 references
tournament
0 references
pathwidth
0 references
cutwidth
0 references
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings (English)
0 references
