Parameterized complexity of the spanning tree congestion problem (Q1759686)
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; zbMATH DE number 6109465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of the spanning tree congestion problem |
scientific article; zbMATH DE number 6109465 |
Statements
Parameterized complexity of the spanning tree congestion problem (English)
0 references
21 November 2012
0 references
spanning tree congestion
0 references
graph minor
0 references
parameterized algorithms
0 references
apex graph
0 references
0 references
0 references
0.9317148327827454
0 references
0.8684943914413452
0 references
0.8655784726142883
0 references
0.8006308078765869
0 references
0.7948628664016724
0 references
