Pith. sign in

The path from 饾憼 is enqueued into 饾憚

Pruning using priority queues at each vertex A priority que 饾憚 is placed at a starting vertex 饾憼 (a source vertex, a target vertex in case of 饾憳bidirectional Dijkstra algorithm)

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.DS 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

A New k-Shortest Path Search Approach based on Graph Reduction

cs.DS 路 2019-08-18 路 conditional 路 novelty 4.0

Graph reduction using shortest-path distances from source and target can speed up k-shortest loop-less path search, with large reported speedups on some graph families but losses to a bidirectional baseline on others.

citing papers explorer

Showing 1 of 1 citing paper.

  • A New k-Shortest Path Search Approach based on Graph Reduction cs.DS 路 2019-08-18 路 conditional 路 none 路 ref 2

    Graph reduction using shortest-path distances from source and target can speed up k-shortest loop-less path search, with large reported speedups on some graph families but losses to a bidirectional baseline on others.