scientific article; zbMATH DE number 742967
From MaRDI portal
Publication:4763409
Recommendations
Cited in
(22)- An on-line graph coloring algorithm with sublinear performance ratio
- A competitive analysis of the list update problem with lookahead
- A still better performance guarantee for approximate graph coloring
- Lower bounds for on-line graph coloring
- Delayed information and action in on-line algorithms
- Online coloring known graphs
- The dynamic frequency assignment problem
- A tight bound for online colouring of disk graphs
- Bounds on partial online list colouring
- Approximation and online algorithms for multidimensional bin packing: a survey
- Circumference, chromatic number and online coloring
- Lower bounds for on-line graph colorings
- Online graph coloring against a randomized adversary
- Online Bounded Coloring of Permutation and Overlap Graphs
- Impartial coloring games
- scientific article; zbMATH DE number 65708 (Why is no real title available?)
- scientific article; zbMATH DE number 1256772 (Why is no real title available?)
- A competitive analysis of the list update problem with lookahead
- Structural Information and Communication Complexity
- Online coloring and a new type of adversary for online graph problems
- Online coloring and a new type of adversary for online graph problems
- On-line approach to off-line coloring problems on graphs with geometric representations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763409)
