Optimal parallel time bounds for the maximum clique problem on intervals (Q1198058): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Optimal bounds for decision problems on the CRCW PRAM / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel Merge Sort / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Faster optimal parallel prefix sums and list ranking / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of comparability graph recognition and coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel Prefix Computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the maximum, merging, and sorting in a parallel computation model / rank | |||
Normal rank |
Revision as of 15:35, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal parallel time bounds for the maximum clique problem on intervals |
scientific article |
Statements
Optimal parallel time bounds for the maximum clique problem on intervals (English)
0 references
16 January 1993
0 references
lower and upper bounds
0 references
PRAM
0 references
maximum clique
0 references
intervals
0 references
0 references