arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.09355cs.DS
收藏

关于图上匹配路由的新结果

New Results On Routing Via Matchings On Graphs

Indranil Banerjee, Dana Richards

摘要:

在本文中,我们提出了一些新的复杂性结果的路由时间下的\textit{routing via matching}模型。这是Alon等人\cite{alon1994routing}提出的一种并行路由模型。该模型可以看作是一个分布式网络上的通信方案。网络中的节点可以通过匹配(步骤)进行通信,其中节点与其匹配的伙伴交换数据(卵石)。设$G$是一个连通图,其顶点标记为$\{1,...,n\}$,pebbles的目的顶点由置换$π$给出.问题是找到一个最小的步骤路由方案的输入置换$π$。这被表示为给定$π$的$G$的路由时间$rt(G,π)$。本文主要讨论了在匹配路由模型下一些已知问题的复杂性,并讨论了它们与图的连通度和团数的关系。我们还介绍了一些新的问题,在这一领域,这可能是独立的利益。

英文摘要:

In this paper we present some new complexity results on the routing time of a graph under the \textit{routing via matching} model. This is a parallel routing model which was introduced by Alon et al\cite{alon1994routing}. The model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data (pebbles) with its matched partner. Let $G$ be a connected graph with vertices labeled from $\{1,...,n\}$ and the destination vertices of the pebbles are given by a permutation $π$. The problem is to find a minimum step routing scheme for the input permutation $π$. This is denoted as the routing time $rt(G,π)$ of $G$ given $π$. In this paper we characterize the complexity of some known problems under the routing via matching model and discuss their relationship to graph connectivity and clique number. We also introduce some new problems in this domain, which may be of independent interest.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑