"Solving the all-pair shortest path query problem on interval and ..."

Danny Z. Chen et al. (1998)

> Home

Details and statistics

DOI: 10.1002/(SICI)1097-0037(199807)31:4<249::AID-NET5>3.0.CO;2-D

access: closed

type: Journal Article

metadata version: 2019-08-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/ChenLSS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/ChenLSS98
Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan:
Solving the all-pair shortest path query problem on interval and circular-arc graphs. Networks 31(4): 249-258 (1998)

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.