The parallel complexity of approximating the high degree subgraph problem (Q1275085)
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: The parallel complexity of approximating the high degree subgraph problem |
scientific article; zbMATH DE number 1238809
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parallel complexity of approximating the high degree subgraph problem |
scientific article; zbMATH DE number 1238809 |
Statements
The parallel complexity of approximating the high degree subgraph problem (English)
0 references
12 January 1999
0 references
P-completeness
0 references
parallel approximation algorithms
0 references
random graphs
0 references
0 references
0 references
0 references
