Претраживање
Приказ резултата 1-1 од 1
Routing tree implementation based on semimatching algorithm(s)
(IEEE, New York, 2013)
This paper proposes and evaluates the variation of an algorithm for optimal semi-matching, based on the Hungarian method. The proposed algorithm balances the parent-child vertexes in a bipartite graph and can be applied ...