"Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks."

Muhammad Farhan, Henning Koehler, Qing Wang (2025)

> Home

Details and statistics

DOI: 10.1145/3725400

access: closed

type: Journal Article

metadata version: 2025-08-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pacmmod/FarhanKW25a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pacmmod/FarhanKW25a
Muhammad Farhan, Henning Koehler, Qing Wang:
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks. Proc. ACM Manag. Data 3(3): 149:1-149:25 (2025)

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.