On the typical case complexity of graph optimization (Q2581548): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.05.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2133404696 / rank | |||
Normal rank | |||
Revision as of 19:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the typical case complexity of graph optimization |
scientific article |
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
