Pages that link to "Item:Q486981"
From MaRDI portal
The following pages link to Online coloring of bipartite graphs with and without advice (Q486981):
Displaying 12 items.
- Online bin packing with advice (Q261387) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- Lower Bounds for On-line Graph Colorings (Q2942655) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- Online Graph Coloring Against a Randomized Adversary (Q3177338) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5918632) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5970811) (← links)
