Solving NP-hard semirandom graph problems in polynomial expected time (Q3437092)
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 5152421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving NP-hard semirandom graph problems in polynomial expected time |
scientific article; zbMATH DE number 5152421 |
Statements
Solving NP-hard semirandom graph problems in polynomial expected time (English)
0 references
14 May 2007
0 references
0.91448057
0 references
0.90713453
0 references
0.89089566
0 references
0.87568045
0 references
0 references
