Shortcutting directed and undirected networks with a degree constraint (Q507583)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortcutting directed and undirected networks with a degree constraint |
scientific article |
Statements
Shortcutting directed and undirected networks with a degree constraint (English)
0 references
6 February 2017
0 references
networks
0 references
rooted directed trees
0 references
DAGs
0 references
compression
0 references
shortcutting
0 references
diameter
0 references
feedback dimension
0 references
path covers
0 references
stability number
0 references
NP-hardness
0 references
\(W[2]\)-hardness
0 references
0 references
0 references
