On the advice complexity of the online -coloring problem on paths and cycles
Authors:
- Maria Paola BianchiMBMaria Paola Bianchi
- Hans-Joachim BöckenhauerHBHans-Joachim Böckenhauer
- Juraj HromkovičJHJuraj Hromkovič
- Sacha KrugSKSacha Krug
- Björn SteffenBSBjörn Steffen
- 1 October 2014
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 554, 22-39
Abstract
No abstract availableKeywords
Funding Information
- SNF (200021-141089)
This publication has 5 references indexed in Scilit:
- Measuring the problem-relevant information in inputRAIRO - Theoretical Informatics and Applications, 2009
- A survey on labeling graphs with a condition at distance twoDiscrete Mathematics, 2006
- Approximations for -Colorings of GraphsThe Computer Journal, 2004
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985