Pages that link to "Item:Q4763409"
From MaRDI portal
The following pages link to Lower bounds for on-line graph coloring (Q4763409):
Displaying 19 items.
- Impartial coloring games (Q388789) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- A still better performance guarantee for approximate graph coloring (Q1209311) (← links)
- Lower bounds for on-line graph coloring (Q1331951) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- Online coloring known graphs (Q1967115) (← links)
- The dynamic frequency assignment problem (Q2378376) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Bounds on partial online list colouring (Q2398499) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- Online Bounded Coloring of Permutation and Overlap Graphs (Q3503553) (← links)
- (Q4010319) (← links)
- Parallel and On-Line Graph Coloring (Q4339004) (← links)
- A Competitive analysis of the list update problem with lookahead (Q5096877) (← links)
- Structural Information and Communication Complexity (Q5710098) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5918632) (← links)