Resource-sharing system scheduling and circular chromatic number (Q1770401): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023012701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The star chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interleaved multichromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing resources at nonuniform access rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some aspects of parallel and distributed iterative algorithms - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of a synchronizer yields the maximum computation rate in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (k,d)-colorings and fractional nowhere-zero flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic graph coloring and the complexity of the star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multichromatic numbers, star chromatic numbers and Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fractional chromatic number, the chromatic number, and graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the period length of a distributed scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On directed local chromatic number, shift graphs, and Borsuk-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic numbers and products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular colouring and graph homomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of Hajós’ Theorem for the circular chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular colouring and orientation of graphs / rank
 
Normal rank

Latest revision as of 19:15, 7 June 2024

scientific article
Language Label Description Also known as
English
Resource-sharing system scheduling and circular chromatic number
scientific article

    Statements

    Resource-sharing system scheduling and circular chromatic number (English)
    0 references
    0 references
    0 references
    6 April 2005
    0 references
    Circular chromatic number
    0 references
    Scheduling
    0 references
    Fairness
    0 references
    Fractional chromatic number
    0 references
    Homomorphism
    0 references
    Scheduling by edge reversal
    0 references
    Minimum mean cycle
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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