The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:30, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem |
scientific article |
Statements
The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (English)
0 references
27 September 1992
0 references
approximation algorithms
0 references
maximum acyclic subgraph problem
0 references
EREW PRAM
0 references
parallel complexity
0 references
