Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Faster optimal parallel prefix sums and list ranking / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel algorithms for fractional and maximal independent sets in planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992991 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructing a Maximal Independent Set in Parallel / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3795245 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Parallel 5-Colouring of Planar Graphs / rank | |||
Normal rank |
Revision as of 16:07, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal parallel 3-coloring algorithm for rooted trees and its applications |
scientific article |
Statements
Optimal parallel 3-coloring algorithm for rooted trees and its applications (English)
0 references
28 June 1992
0 references
graph coloring
0 references
rooted trees
0 references
CRCW PRAM
0 references
optimal parallel algorithms
0 references
planar graphs
0 references