A new lower bound for the on-line coloring of intervals with bandwidth (Q1686078): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for online coloring of intervals with bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-coloring and online coloring with bandwidths on interval graphs / rank
 
Normal rank

Latest revision as of 21:55, 14 July 2024

scientific article
Language Label Description Also known as
English
A new lower bound for the on-line coloring of intervals with bandwidth
scientific article

    Statements

    A new lower bound for the on-line coloring of intervals with bandwidth (English)
    0 references
    0 references
    20 December 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    online coloring
    0 references
    interval graphs
    0 references
    weighted intervals
    0 references
    0 references
    0 references