On the complexity of packing rainbow spanning trees (Q2685331)
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: On the complexity of packing rainbow spanning trees |
scientific article; zbMATH DE number 7655646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of packing rainbow spanning trees |
scientific article; zbMATH DE number 7655646 |
Statements
On the complexity of packing rainbow spanning trees (English)
0 references
21 February 2023
0 references
common bases
0 references
common spanning sets
0 references
complexity
0 references
matroids
0 references
packing problems
0 references
rainbow spanning trees
0 references
0.8091325759887695
0 references
0.8060809969902039
0 references
0.8002238869667053
0 references
0.7969725728034973
0 references
0.7868172526359558
0 references
