"Fast approximate shortest paths in the congested clique."

Keren Censor-Hillel et al. (2021)

> Home

Details and statistics

DOI: 10.1007/S00446-020-00380-5

access: closed

type: Journal Article

metadata version: 2021-11-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dc/Censor-HillelDK21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dc/Censor-HillelDK21
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast approximate shortest paths in the congested clique. Distributed Comput. 34(6): 463-487 (2021)

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.