"Hardness and approximation results for Black Hole Search in arbitrary ..."

Ralf Klasing et al. (2007)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2007.04.024

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/KlasingMRS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KlasingMRS07
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco:
Hardness and approximation results for Black Hole Search in arbitrary networks. Theor. Comput. Sci. 384(2-3): 201-221 (2007)

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.