On the advice complexity of the online L(2,1)-coloring problem on paths and cycles

Authors:
  • MBMaria Paola Bianchi
    Maria Paola Bianchi
  • HBHans-Joachim Böckenhauer
    Hans-Joachim Böckenhauer
  • JHJuraj Hromkovič
    Juraj Hromkovič
  • SKSacha Krug
    Sacha Krug
  • BSBjörn Steffen
    Björn Steffen

Abstract
No abstract available
Funding Information
  • SNF (200021-141089)

This publication has 5 references indexed in Scilit: