A parllel algorithm for finding a maximum weight clique of an interval graph (Q582125)
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: A parllel algorithm for finding a maximum weight clique of an interval graph |
scientific article; zbMATH DE number 4130046
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parllel algorithm for finding a maximum weight clique of an interval graph |
scientific article; zbMATH DE number 4130046 |
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
0.9126727
0 references
0.9123037
0 references
0.9079314
0 references
0.90732586
0 references
0.9053343
0 references
0.9036052
0 references
0.90115917
0 references
0.9009717
0 references
