"Efficient parameterized algorithms for computing all-pairs shortest paths."

Stefan Kratsch, Florian Nelles (2023)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2023.07.029

access: closed

type: Journal Article

metadata version: 2023-12-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/KratschN23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/KratschN23
Stefan Kratsch, Florian Nelles:
Efficient parameterized algorithms for computing all-pairs shortest paths. Discret. Appl. Math. 341: 102-119 (2023)

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.