PSTw adapts the authors' unweighted PST idea to weighted graphs, adds a waiting mechanism to avoid deadlock, and reports CPU-time and edge-access advantages over Dijkstra and Peng on several synthetic graph classes.
Breadth-first search
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A New Fast Weighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees
PSTw adapts the authors' unweighted PST idea to weighted graphs, adds a waiting mechanism to avoid deadlock, and reports CPU-time and edge-access advantages over Dijkstra and Peng on several synthetic graph classes.