"Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs."

Telikepalli Kavitha (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-77050-3_27

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fsttcs/Kavitha07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/Kavitha07
Telikepalli Kavitha:
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. FSTTCS 2007: 328-339

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.