4 citations · 4 across the 1 of their papers we have counts for
1 paper
Martin Kučera, Ondřej Suchý
The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known to be NP-complete and…