نتایج جستجو برای: the spanning tree

تعداد نتایج: 16074627  

Journal: :Proceedings of the American Mathematical Society 1991

Journal: :International Journal of Computer Applications 2013

Journal: :Journal of Physics A: Mathematical and General 2005

2012
S. L. Loh S. Salleh N. H. Sarmin

A spanning tree of a connected graph is a tree which consists the set of vertices and some or perhaps all of the edges from the connected graph. In this paper, a model for spanning tree transformation of connected graphs into single-row networks, namely Spanning Tree of Connected Graph Modeling (STCGM) will be introduced. Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is co...

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده فنی 1393

a problem of computer vision applications is to detect regions of interest under dif- ferent imaging conditions. the state-of-the-art maximally stable extremal regions (mser) detects affine covariant regions by applying all possible thresholds on the input image, and through three main steps including: 1) making a component tree of extremal regions’ evolution (enumeration), 2) obtaining region ...

Journal: :Proceedings of National Aviation University 2007

Journal: :Automatic Control and Computer Sciences 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید