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

@@ Property / author @@
-Juraj Hromkovič
@@ Property / author: Juraj Hromkovič / rank @@
-Normal rank
@@ Property / author @@
+Juraj Hromkovič
@@ Property / author: Juraj Hromkovič / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W27
@@ Property / Mathematics Subject Classification ID: 68W27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 05C15 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6387681
@@ Property / zbMATH DE Number: 6387681 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+online coloring
@@ Property / zbMATH Keywords: online coloring / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lower bounds
@@ Property / zbMATH Keywords: lower bounds / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+advice complexity
@@ Property / zbMATH Keywords: advice complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bipartite graph
@@ Property / zbMATH Keywords: bipartite graph / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+OEIS
@@ Property / describes a project that uses: OEIS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2038445565
@@ Property / OpenAlex ID: W2038445565 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective coloration
@@ Property / cites work: Effective coloration / rank @@
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of the Knapsack Problem
@@ Property / cites work: On the Advice Complexity of the Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of Online Problems
@@ Property / cites work: On the Advice Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+How Much Information about the Future Is Needed?
@@ Property / cites work: How Much Information about the Future Is Needed? / rank @@
+Normal rank
@@ Property / cites work @@
+Universal codeword sets and representations of the integers
+Normal rank
@@ Property / cites work @@
+Online Computation with Advice
@@ Property / cites work: Online Computation with Advice / rank @@
+Normal rank
@@ Property / cites work @@
+Q4440308
@@ Property / cites work: Q4440308 / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Complexity of Online Coloring for Paths
@@ Property / cites work: Advice Complexity of Online Coloring for Paths / rank @@
+Normal rank
@@ Property / cites work @@
+On-line and first fit colorings of graphs
@@ Property / cites work: On-line and first fit colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Information Complexity of Online Problems
@@ Property / cites work: Information Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249728
@@ Property / cites work: Q4249728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4010310
@@ Property / cites work: Q4010310 / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Complexity and Barely Random Algorithms
@@ Property / cites work: Advice Complexity and Barely Random Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An on-line graph coloring algorithm with sublinear performance ratio
+Normal rank
@@ Property / cites work @@
+Randomized online graph coloring
@@ Property / cites work: Randomized online graph coloring / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:486981