Online coloring of bipartite graphs with and without advice (Q486981): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Juraj Hromkovič / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| 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 | |||
Revision as of 20:46, 30 June 2023
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
19 January 2015
0 references
online coloring
0 references
lower bounds
0 references
advice complexity
0 references
bipartite graph
0 references
