摘要 : 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 ... 展开
作者 | Dragan~ Feodor F. Leitert~ Arne |
---|---|
作者单位 | |
期刊名称 | 《Theoretical computer science》 |
总页数 | 13 |
语种/中图分类号 | 英语 / TP3 |
关键词 | Graph algorithms Approximation algorithms Minimum eccentricity shortest path Minimum distortion embedding into the line k-Dominating set NP-complete and W[2]-hard problems |
馆藏号 | N2007EPST0003294 |