On the complexity of the vector connectivity problem (Q2354404)
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 6458170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the vector connectivity problem |
scientific article; zbMATH DE number 6458170 |
Statements
On the complexity of the vector connectivity problem (English)
0 references
13 July 2015
0 references
vector connectivity
0 references
APX-hardness
0 references
NP-hardness
0 references
polynomial-time algorithm
0 references
block graphs
0 references
0 references
0 references
0.8761290311813354
0 references
0.8760992884635925
0 references
0.8315309286117554
0 references
0.8229770064353943
0 references
