On-line algorithms for 2-coloring hypergraphs via chip games (Q1210300): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a Combinatorial Problem of Erdös and Hajnal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein kombinatorisches Problem von P. Erdős und A. Hajnal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481743 / rank
 
Normal rank

Latest revision as of 16:53, 17 May 2024

scientific article
Language Label Description Also known as
English
On-line algorithms for 2-coloring hypergraphs via chip games
scientific article

    Statements

    On-line algorithms for 2-coloring hypergraphs via chip games (English)
    0 references
    0 references
    0 references
    24 May 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    chip games
    0 references
    hypergraphs
    0 references
    2-coloring
    0 references
    bounds
    0 references
    on-line 2-coloring algorithm
    0 references