"Pruning the Computation of Distributed Shortest Paths in Power-law Networks."

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni (2013)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition @ informatica.si (open access)
- export record
  dblp key:
  - journals/informaticaSI/DAngeloDF13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informaticaSI/DAngeloDF13
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia) 37(3): 253-265 (2013)

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.