"Incremental FO(+, <) Maintenance of All-Pairs Shortest Paths for ..."

Chaoyi Pang, Kotagiri Ramamohanarao, Guozhu Dong (1999)

> Home

Details and statistics

DOI: 10.1007/3-540-49257-7_23

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icdt/PangRD99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdt/PangRD99
Chaoyi Pang, Kotagiri Ramamohanarao, Guozhu Dong:
Incremental FO(+, <) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions. ICDT 1999: 365-382

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.