Search
Search Results
Found one item.
-
495 171 Cited —The spanning tree of a graph is obtained when all vertices of a graph are connected in such a way that no cycle is formed. This work proposes a new algorithm that, at each round, selects a maximal …
1 - 1 of 1 items

