arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1308.2865math.CO
收藏

网络的最小集线器数

The Minimum Number of Hubs in Networks

Easton Li Xu, Guangyue Han

摘要:

在本文中,枢纽是指度至少为3的非终结点。我们研究了网络中所需的枢纽的最小数量,以保证多对源和汇之间施加一定的流量需求约束。我们证明了在约束条件下,无论网络的大小或拓扑结构如何,这样的最小数目总是有上界的,并且对一些特殊的参数,我们得到了紧的上界。特别是,对于两对源和汇,我们提出了一种新的路径搜索算法,其中的分析是有助于推导的紧上界。

英文摘要:

In this paper, a hub refers to a non-terminal vertex of degree at least three. We study the minimum number of hubs needed in a network to guarantee certain flow demand constraints imposed between multiple pairs of sources and sinks. We prove that under the constraints, regardless of the size or the topology of the network, such minimum number is always upper bounded and we derive tight upper bounds for some special parameters. In particular, for two pairs of sources and sinks, we present a novel path-searching algorithm, the analysis of which is instrumental for the derivations of the tight upper bounds.

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

↑