P. Tatam, "Finding minimum spanning trees more efficiently for tile-based phase unwrapping," Meas. Sci. Technol. 17, 1428-1435 (2006).Sawaf F, Tatam RP (2006) Finding minimum spanning trees more efficiently for tile-based phase unwrapping. Measurement Science and Technology 17(6):1428-1435....
来自 Elsevier 喜欢 0 阅读量: 200 作者: CC Yao 摘要: Publication » An 0(|E|loglog|V|) algorithm for finding minimum spanning trees. 关键词: Minimum spanning tree linear median finding algorithm DOI: 10.1016/0020-0190(75)90056-3 被引量: 261 年份: 1975 ...
A minimum degree spanning tree of a graph G is a spanning tree of G whose maximum degree is minimum among all spanning trees of G. The minimum degree spanning tree problem (MDST) is to construct such a spanning tree of a graph. In this paper, we propose a polynomial-time algorithm for...
1. Bock, F., "An Algorithm t o Construct a Minimum Directed Spanning Tree i n a Directed Network," Devezopments i n Operations Research, Gordon and Breach, New York, 1971, pp. 29-44. 2. Cheriton, D. and R. Tarjan, "Finding Minimum Spanning Trees," SIAMJ. Cornput., 5, 1976,...
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 ...
The k best orthogonal spanning trees in the plane can be found in time O ( n log n + kn log log( n/k )+ k 2 ). 年份: 1992 收藏 引用 批量引用 报错 分享 全部来源 求助全文 全文购买 ResearchGate www.socolar.com 相似文献An efficient method for finding the minimum of a function of...
This paper shows that it is possible to find all isomorphic subtrees of a binary tree in linear time and space. A Thomason 被引量: 0发表: 1989年 Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest A pseudoforest is a graph, each of whose connected components is a tree or a...
Faster Swap Edge Computation in Minimum Diameter Spanning Trees In network communication systems, frequently messages are routed along a minimum diameter spanning tree (MDST) of the network, to minimize the maximum trav... B Gfeller - Springer-Verlag New York, Inc. 被引量: 25发表: 2012年 A ...
P. M. Camerini, G. Galbiati, F. Maffioli, On the Complexity of Finding Multi- constrained Spanning Trees, Discrete Applied Mathematics vol.5, 1983P. Camerini, G. Galbiati, and F. Maffioli. On the complexity of finding multi-constrained spanning trees. Discrete Applied Mathematics, 5:39- ...
Minimum spanning trees and single linkage cluster analysis Applied Statistics (1969) D.J. Hand Discrimination and Classification (1981) S.K. Kachigan Multivariate Statistical Analysis, a Conceptual Introduction (1991) T. Kohonen Self-Organizing Maps. Series in Information Sciences (1997) There are mo...