Minimum entropy coloring (Q1016051): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient labeling procedures for image partition encoding. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source coding and graph entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible edge colorings of trees with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equality of the partial Grundy and upper ochromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Results for the Optimum Cost Chromatic Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and sorting. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the NP-completeness of minimum sum interval coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Test for Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zero-error side information problem and chromatic numbers (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossless and near-lossless source coding for multiple access networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Revision as of 12:29, 1 July 2024

scientific article
Language Label Description Also known as
English
Minimum entropy coloring
scientific article

    Statements

    Minimum entropy coloring (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2009
    0 references
    complexity
    0 references
    entropy
    0 references
    graph coloring
    0 references

    Identifiers