"Computing All-Pairs Shortest Paths by Leveraging Low Treewidth."

Léon Planken, Mathijs de Weerdt, Roman van der Krogt (2012)

> Home

Details and statistics

DOI: 10.1613/JAIR.3509

access: open

type: Journal Article

metadata version: 2019-01-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jair/PlankenWK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jair/PlankenWK12
Léon Planken, Mathijs de Weerdt, Roman van der Krogt:
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. J. Artif. Intell. Res. 43: 353-388 (2012)

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.