Competitive vertex recoloring. (Online disengagement) (Q6107890): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Dynamic Balanced Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online balanced repartitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal on-line algorithm for metrical task system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6059176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel and On-Line Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-offs in dynamic coloring for bipartite and general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Dynamic Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Revision as of 12:47, 1 August 2024

scientific article; zbMATH DE number 7704067
Language Label Description Also known as
English
Competitive vertex recoloring. (Online disengagement)
scientific article; zbMATH DE number 7704067

    Statements

    Competitive vertex recoloring. (Online disengagement) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2023
    0 references
    coloring with recourse
    0 references
    anti-affinity constraints
    0 references
    online migration
    0 references

    Identifiers