A parllel algorithm for finding a maximum weight clique of an interval graph (Q582125): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:45, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parllel algorithm for finding a maximum weight clique of an interval graph |
scientific article |
Statements
A parllel algorithm for finding a maximum weight clique of an interval graph (English)
0 references
1990
0 references
parallel algorithm
0 references
parallel random access machine
0 references
complexity analysis
0 references
EREW-PRAM
0 references
maximum weight clique
0 references
interval graph
0 references
