Database Paper Browser

Back to papers

Constrained Shortest Path Query in a Large Time-Dependent Graph

Summary: Constrained shortest-path queries in large time-dependent graphs; defines PCSP and ICSP. NP-completeness for PCSP and EXPSPACE for ICSP; introduces approximate sequential algorithms and parallel scalable solutions, with real-network experiments confirming efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11806
Venue
VLDB
Year
2019
Pagerank
5.7909705e-05
Overall Rank
4,973 | 65.41%
DOI
10.14778/3339490.3339491

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers