The complexity of spanning tree problems involving graphical indices (Q6202942)
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: The complexity of spanning tree problems involving graphical indices |
scientific article; zbMATH DE number 7809932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of spanning tree problems involving graphical indices |
scientific article; zbMATH DE number 7809932 |
Statements
The complexity of spanning tree problems involving graphical indices (English)
0 references
27 February 2024
0 references
graphical function-index
0 references
spanning tree
0 references
NP-completeness
0 references
APX-completeness
0 references
0 references
0 references
0.7799485921859741
0 references
0.7695418000221252
0 references
