"On the complexity of the shortest-path broadcast problem."

Pierluigi Crescenzi et al. (2016)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2015.05.004

access: open

type: Journal Article

metadata version: 2023-11-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/CrescenziFHHPPP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/CrescenziFHHPPP16
Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci:
On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. 199: 101-109 (2016)

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.