DEVELOPMENT OF A MIDDLEWARE FOR SEARCHING SHORTEST-PATH IN TIME-DEPENDENT GRAPH
Time-dependent graph defined as a graph that represent dynamic object. Searching shortest-path in this graph requires consideration of graph state in multiple time instance. Path building process does not only involve choosing right node to visit. It also involve picking the right time to visit the...
Saved in:
Main Author: | Imantoro, Cendhika |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/43706 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
Shortest Path Problem with Cache-Dependent Path Lengths
by: FU, Z., et al.
Published: (2003) -
Shortest path problem with cache dependent path lengths
by: Fu, Z., et al.
Published: (2016) -
A machine learning-based approach to time-dependent shortest path queries
by: Wei, Yumou
Published: (2017) -
Efficient Verification of Shortest Path Search Via Authenticated Hints
by: YIU, Man Lung, et al.
Published: (2010) -
Efficient temporal graph processing : shortest paths, closeness centralities and S-cliques
by: Ni, Peng
Published: (2021)