scientific article; zbMATH DE number 742967
From MaRDI portal
Publication:4763409
zbMath0829.68096MaRDI QIDQ4763409
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Lower bounds for on-line graph coloring ⋮ The dynamic frequency assignment problem ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A competitive analysis of the list update problem with lookahead ⋮ Impartial coloring games ⋮ A Competitive analysis of the list update problem with lookahead ⋮ Circumference, chromatic number and online coloring ⋮ A still better performance guarantee for approximate graph coloring ⋮ Online coloring and a new type of adversary for online graph problems ⋮ Delayed information and action in on-line algorithms
This page was built for publication:
