Computing the zig-zag number of directed graphs (Q831867)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the zig-zag number of directed graphs |
scientific article; zbMATH DE number 7497779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the zig-zag number of directed graphs |
scientific article; zbMATH DE number 7497779 |
Statements
Computing the zig-zag number of directed graphs (English)
0 references
24 March 2022
0 references
zig-zag number
0 references
directed graphs
0 references
directed width measure
0 references
NP-completeness
0 references
computational complexity
0 references
0.7080913186073303
0 references
0.6901195049285889
0 references
0.6814184784889221
0 references
