Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90045-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163058176 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:40, 30 July 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
    0 references
    28 June 1992
    0 references
    0 references
    graph coloring
    0 references
    rooted trees
    0 references
    CRCW PRAM
    0 references
    optimal parallel algorithms
    0 references
    planar graphs
    0 references
    0 references