"Hardness and approximation for the geodetic set problem in some graph classes."

Dibyayan Chakraborty et al. (2019)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2019-09-24

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1909-08795
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1909-08795
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and approximation for the geodetic set problem in some graph classes. CoRR abs/1909.08795 (2019)

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.