Finding the Most Degree-Central Shortest Path: Algorithms and Complexity Results

This paper proposes an efficient polynomial algorithm to find the most degree-central shortest path in an unweighted graph, and shows that the problem becomes NP-hard when the graph is weighted.