There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...
Fuzzy optimization for shortest path problems addresses uncertainty in network weights by representing arc costs with fuzzy numbers rather than crisp values. By extending classical algorithms—such as ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results