Connecting Vertices by Independent Trees (Q2978503)
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 6707757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connecting Vertices by Independent Trees |
scientific article; zbMATH DE number 6707757 |
Statements
25 April 2017
0 references
parameterized complexity
0 references
FPT-algorithms
0 references
completely independent spanning trees
0 references
Connecting Vertices by Independent Trees (English)
0 references
0 references
0 references
0 references
0 references
0.8897284
0 references
0.8896586
0 references
0 references
0.8840302
0 references
