Login / Signup
A tight bound for online colouring of disk graphs.
Ioannis Caragiannis
Aleksei V. Fishkin
Christos Kaklamanis
Evi Papaioannou
Published in:
Theor. Comput. Sci. (2007)
Keyphrases
</>
upper bound
lower bound
worst case
online learning
real time
series parallel
graph theoretic
directed graph
disk resident
generalization error bounds
data sets
data mining
error bounds
online communities
graph theory
subgraph isomorphism