"A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes."

Siamak Tazari, Matthias Müller-Hannemann (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-92248-3_32

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/TazariM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/TazariM08
Siamak Tazari, Matthias Müller-Hannemann:
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. WG 2008: 360-371

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.