Shortcutting directed and undirected networks with a degree constraint (Q507583)
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: Shortcutting directed and undirected networks with a degree constraint |
scientific article; zbMATH DE number 6680975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortcutting directed and undirected networks with a degree constraint |
scientific article; zbMATH DE number 6680975 |
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
0.8455618023872375
0 references
0.796874463558197
0 references
0.7878093123435974
0 references
0.7718191146850586
0 references
