"On the complexity of the (approximate) nearest colored node problem."

Maximilian Probst (2018)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-01-23

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1807-03721
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1807-03721
Maximilian Probst:
On the complexity of the (approximate) nearest colored node problem. CoRR abs/1807.03721 (2018)

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.