| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4951929 | Theoretical Computer Science | 2017 | 13 Pages |
Abstract
In this paper, we introduce and investigate the Minimum Eccentricity Shortest Path (MESP) problem in unweighted graphs. It asks for a given graph to find a shortest path with minimum eccentricity. Let n and m denote the number of vertices and the number of edges of a given graph. We demonstrate that:
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Feodor F. Dragan, Arne Leitert,