On the typical case complexity of graph optimization (Q2581548)
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 2244802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the typical case complexity of graph optimization |
scientific article; zbMATH DE number 2244802 |
Statements
On the typical case complexity of graph optimization (English)
0 references
10 January 2006
0 references
Typical case complexity
0 references
Nonuniform polynomial time algorithm
0 references
Graph optimization
0 references
Concentration of hardness
0 references
0.88810116
0 references
0.88584363
0 references
0.8826233
0 references
