"A Bellman-Ford algorithm for the path-length-weighted distance in graphs."

Roger Arnau et al. (2024)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2411.00819

access: open

type: Informal or Other Publication

metadata version: 2024-12-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2411-00819
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2411-00819
Roger Arnau, J. M. Calabuig, Lluís Miquel Garcia-Raffi, Enrique Alfonso Sánchez-Pérez, S. Sanjuan:
A Bellman-Ford algorithm for the path-length-weighted distance in graphs. CoRR abs/2411.00819 (2024)

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.