Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128756434, #quickstatements; #temporary_batch_1724910266140
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Distributed Algorithms for Coloring Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number, girth and maximal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal maximal independent set algorithm for bounded-independence graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Tucker's Algorithm to Color Circular Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Locality of Some NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking depending on the chromatic number or the neighborhood growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for distributed symmetry breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed (∆+1)-coloring in sublogarithmic rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal distributed (Δ+1)-coloring algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Graph Coloring: Fundamentals and Recent Developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128756434 / rank
 
Normal rank

Latest revision as of 06:54, 29 August 2024

scientific article; zbMATH DE number 7167177
Language Label Description Also known as
English
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
scientific article; zbMATH DE number 7167177

    Statements

    Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (English)
    0 references
    0 references
    13 February 2020
    0 references
    local model
    0 references
    vertex coloring
    0 references
    interval graph
    0 references
    0 references

    Identifiers

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