A parllel algorithm for finding a maximum weight clique of an interval graph (Q582125): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8191(90)90152-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969414442 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:33, 30 July 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
