With a dropping number of subgraphs, the constructed level-1 graph contains fewer nodes and edges, thereby leading to a decreasing trend on the execution time over Schemes 1 to 4.
← all excerpts
Accurate and fast path computation on large urban road networks: A general approach.
1
—
—