minimum cost spanning tree 读音:美英 minimum cost spanning tree基本解释 最小生成树;最小代价生成树;最小代价生成树问题;最小成本扩张树 分词解释 minimum最低限度 cost价钱,代价 spanning(尤指树形子图)生成的 tree树
最小成本扩张树(minimum cost spanning tree),用於图形的巡行(graph travel)。最小成本扩张树可能不会惟一,需视图形连接 … tw.knowledge.yahoo.com|基于29个网页 3. 最小代价生成树 通网的最小代价生成树(Minimum Cost Spanning Tree),简称为最小生 成树(MST)。
spanning adj. [数](尤指树形子图)生成的 Minimum n. 最小量,最小极限 a. 最小的,最少的 minimum n. 1.最小量; a. 1.最小的,最低的; tree n. 树,木料,树状物 vt. 赶上树 Tree 树状结构使计算机知道如何执行的机器指令。 cost v. 1.[I]【通常不用于进行时态】价钱为,需花费 2.[I]...
1) minimum cost spanning tree(MCST) 最小代价生成树1. Secondly,each the neutral residue set with the Prim algorithm to obtain the minimum cost spanning tree(MCST). 然后采用普里姆算法对各中性残差点集依次处理,获得相应的最小代价生成树,全部最小代价生成树的边就是相位解缠所需的枝切线。
分享到: 【计】 最小代价生成树 分类: 通用词汇|查看相关文献(pubmed)|免费全文文献 详细解释: 以下为句子列表: 分享到:
Minimum-cost spanning tree as a path-finding problem. Information Processing Let- ters, 26(6):291-293, 1988.Maggs B M,Plotkin S A.Minimum-cost spanning trees as a path-finding problem.Information Processing Letters. 1987B. Maggs, S. Plotkin, Minimum cost spanning trees as a path finding ...
1) Minimum cost spanning tree 最小费用支撑树 2) Minimum cost spanning tree game 最小费用支撑树对策 1. This paper develops Glover-Klingman algorithm and Minimu m cost spanning tree game to the Minimum cost k-degree constrained spanning tree game,formulate two strategies with the Threat theory ...
In this paper we show that the minimum-cost spanning tree is a special case of the closed semiring path-finding problem. This observation gives us a nonrecursive algorithm for finding minimum-cost spanning trees on mesh-connected computers which has the same asymptotic running time as but is ...
Minimum-cost spanning tree (MCST) game is a classical model in the theory of cooperative games. The MCST game has been drawing continuous attention since it was raised by Claus and Kleitman in 1973. The MCST game is closely related to the MCST problem, a fundamental model in graph theory ...
We consider the problem of cost allocation among users of a minimum cost spanning tree network. It is formulated as a cooperative game in characteristic function form, referred to as a minimum cost spanning tree (m.c.s.t.) game. We show that the core of a m.c.s.t. game is never ...