Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem (Q2482999)
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: Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem |
scientific article; zbMATH DE number 5270526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem |
scientific article; zbMATH DE number 5270526 |
Statements
Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem (English)
0 references
2 May 2008
0 references
graph bi-partitioning problem
0 references
NP-hard
0 references
backbone analysis
0 references
unique optimal solution instance
0 references
computational complexity
0 references
0 references
0 references
0 references
0.7927825450897217
0 references
0.7606433629989624
0 references
0.7224319577217102
0 references
0.706326425075531
0 references
