Efficient points on a network
Pierre Hansen, Jacques‐Françols Thisse, Richard E. Wendell · Networks · 1986
Abstract Properties of efficient points on a network are given. They are then used to devise (i) a linear algorithm for efficient points on a tree, (ii) on O(m log n) algorithm for the set of links common to all shortest paths between two points, and (iii) a polynomial algorithm for efficient points on a general network.