"A bit-pushing shortest distance algorithm."

Arnon Rosenthal (1975)

> Home

Details and statistics

DOI: 10.1002/NET.3230050402

access: closed

type: Journal Article

metadata version: 2023-09-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/Rosenthal75
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Rosenthal75
Arnon Rosenthal:
A bit-pushing shortest distance algorithm. Networks 5(4): 301-305 (1975)

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.