0
votes
0answers
206 views

Fast removal of weighted edges in a graph in a way such that all shortest paths are preserved

This problem is analogous to fast removal of the minimum number of edges in a weighted graph such that if the graph were to be drawn on paper with edge lengths linear in proportion to their weights, ...