A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283)
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: Publication:911283 |
scientific article; zbMATH DE number 4141502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle |
scientific article; zbMATH DE number 4141502 |
Statements
A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (English)
0 references
1990
0 references
parallel algorithm
0 references
maximum clique
0 references
circular-arc graph
0 references
CREW PRAM
0 references
0.8912581205368042
0 references
0.8785308599472046
0 references
0.8776435852050781
0 references
0.8611503839492798
0 references
