"An efficient algorithm to determine all shortest paths in Sierpiński ..."

Andreas M. Hinz, Caroline Holz auf der Heide (2014)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2014.05.049

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/HinzH14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/HinzH14
Andreas M. Hinz, Caroline Holz auf der Heide:
An efficient algorithm to determine all shortest paths in Sierpiński graphs. Discret. Appl. Math. 177: 111-120 (2014)

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.