"On the Advice Complexity of the Online L(2, 1)-Coloring Problem on ..."

Maria Paola Bianchi et al. (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-38768-5_7

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/BianchiBHKS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/BianchiBHKS13
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen:
On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. COCOON 2013: 53-64

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.