On the advice complexity of the online L(2,1)-coloring problem on paths and cycles
Open access
Autor(in)
Alle anzeigen
Datum
2014-10-16Typ
- Journal Article
ETH Bibliographie
yes
Altmetrics
Persistenter Link
https://doi.org/10.3929/ethz-a-010886736Publikationsstatus
publishedExterne Links
Zeitschrift / Serie
Theoretical Computer ScienceBand
Seiten / Artikelnummer
Verlag
ElsevierThema
Online coloring; Frequency assignment; Advice complexity; Randomized algorithmsOrganisationseinheit
02150 - Dep. Informatik / Dep. of Computer Science03666 - Hromkovic, Juraj (emeritus) / Hromkovic, Juraj (emeritus)
Förderung
141089 - Measuring the Information Content of Online Problems (SNF)
ETH Bibliographie
yes
Altmetrics