公交网络的k-换乘约束直径：考虑出行便利性的连通性指标
The k-interchange-constrained diameter of a transit network: A connectedness indicator that accounts for travel convenience
摘要：
我们研究两个变种的最短路径问题。给定一个整数k，k-颜色约束和k-交换约束的最短路径问题，分别寻求一个最短路径，使用不超过k个颜色和一个，使不超过k - 1交替的颜色。我们表明，前一个问题是NP难的，当后者是听话的。这些问题的研究是出于一些限制使用直径为基础的指标来评估公交网络的拓扑结构。我们特别表明，指标，如直径或直接的交通网络不能充分考虑旅行的便利性，在衡量网络的连通性，并提出了一个新的网络指标，解决k-交换约束的最短路径问题的基础上，旨在减轻这些限制。
英文摘要：
We study two variants of the shortest path problem. Given an integer k, the k-color-constrained and the k-interchange-constrained shortest path problems, respectively seek a shortest path that uses no more than k colors and one that makes no more than k - 1 alternations of colors. We show that the former problem is NP-hard, when the latter is tractable. The study of these problems is motivated by some limitations in the use of diameter-based metrics to evaluate the topological structure of transit networks. We notably show that indicators such as the diameter or directness of a transit network fail to adequately account for travel convenience in measuring the connectivity of a network and propose a new network indicator, based on solving the k-interchange-constrained shortest path problem, that aims at alleviating these limitations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
