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

Maria Paola Bianchi et al. (2014)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2014.06.027

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/BianchiBHKS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BianchiBHKS14
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. Theor. Comput. Sci. 554: 22-39 (2014)

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.