PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS (Q5248988): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Deterministic parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel time bounds for the maximum clique problem on intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems complete for deterministic logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Deterministic Processor Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressibility and Parallel Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation and conflicts in memory access / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Simplicity of Compaction and Chaining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the maximum, merging, and sorting in a parallel computation model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly parallelizable problems on sorted intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in Comparison Problems / rank
 
Normal rank

Latest revision as of 00:16, 10 July 2024

scientific article; zbMATH DE number 6431996
Language Label Description Also known as
English
PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS
scientific article; zbMATH DE number 6431996

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references