Online coloring of bipartite graphs with and without advice (Q486981): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-013-9819-7 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038445565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective coloration / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Much Information about the Future Is Needed? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Computation with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity of Online Coloring for Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity and Barely Random Algorithms / 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: Randomized online graph coloring / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-013-9819-7 / rank
 
Normal rank

Latest revision as of 20:03, 9 December 2024

scientific article
Language Label Description Also known as
English
Online coloring of bipartite graphs with and without advice
scientific article

    Statements

    Online coloring of bipartite graphs with and without advice (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 January 2015
    0 references
    online coloring
    0 references
    lower bounds
    0 references
    advice complexity
    0 references
    bipartite graph
    0 references

    Identifiers