The minimum spanning subgraph problem with given cyclomatic number (Q3466909)
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 minimum spanning subgraph problem with given cyclomatic number |
scientific article; zbMATH DE number 6535312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum spanning subgraph problem with given cyclomatic number |
scientific article; zbMATH DE number 6535312 |
Statements
25 January 2016
0 references
minimum spanning subgraph
0 references
reverse problem
0 references
cyclomatic number
0 references
polynomial time algorithm
0 references
strongly NP-hard
0 references
0.7559370398521423
0 references
0.7529169321060181
0 references
0.7481686472892761
0 references
0.7427355647087097
0 references
0.7354900240898132
0 references
