نتایج جستجو برای: Minimum Spanning Tree
تعداد نتایج: 365629 فیلتر نتایج به سال:
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
Given a set S of n points, we show that the length of 1) the minimum weight triangulation (MWT ) of the minimum weight convex partition (MWCP ) of S (TMWCP ) is at most Θ(n) longer than the MWT of S if collinearity of two or more edges is allowed and Θ(log n) otherwise, 2) the MWT of the minimum spanning tree (MST ) of the MWCP of S (Tmst(MWCP )) is at most Θ(n) longer than the MWT of S if coll...
there have been several efforts in the literature to extract as much information as possible from the financial networks. most of the research has been concerned about the hierarchical structures, clustering, topology and also the behavior of the market network; but not a notable work on the network filtration exists. this paper proposes a stock market filtering model using the correlation - ba...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید