Note on the hardness of generalized connectivity (Q1928526)
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: Note on the hardness of generalized connectivity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note on the hardness of generalized connectivity |
scientific article |
Statements
Note on the hardness of generalized connectivity (English)
0 references
3 January 2013
0 references
\(k\)-connectivity
0 references
internally disjoint trees
0 references
complexity
0 references
polynomial-time
0 references
NP-complete
0 references
0.8517075181007385
0 references
0.8341474533081055
0 references
0.8288108110427856
0 references
0.8169237971305847
0 references
