Sentence examples for based on spanning tree from inspiring English sources

To tackle such an NP-hard problem, there are several genetic algorithms based on spanning tree and Prüfer number representation.

Contrary to the findings in previous works, considering the genetic algorithm (GA) based on spanning tree, we present a pioneer method to design a chromosome that does not need a repairing procedure for feasibility, i.e. all the produced chromosomes are feasible.

In Section 3, we propose NBP method based on spanning trees.

In this paper, we propose NBP based on spanning trees (NBP-ST) created by breadth first search (BFS) method [15, 16] which is optimal for the unweighted graphs.

Therefore, in this paper, we propose a novel approach, NBP based on spanning trees (NBP-ST) created by breadth first search (BFS) method.

Therefore, we proposed NBP-ST method based on spanning trees created by the BFS method which is optimal for the unweighted graphs.

Our previous proposals, using NBP based on spanning trees [16] and uniformly-reweighted NBP [17], can mitigate this problem in highly connected networks, but with very small benefit comparing with NBP.

In particular, the most simple multicasting algorithms (e.g., separate addressing) may outperform sophisticated algorithms usually considered more effective, such as those based on spanning-trees.

We address robustness and efficiency in a novel family of multi-robot coverage algorithms, based on spanning-tree coverage of approximate cell decomposition of the work-area.

Region Adjacency Graph (RAG) is then used to represent region structure to facilitate the merge procedure where similar regions are iteratively merged into new homogeneous ones based on minimum spanning tree algorithm.

The Three-Dimensional Position-Based Adaptive Real-Time Routing Protocol (3DPBARP) is one of the many-to-one routing protocols which is based on the spanning tree method [1, 2].