Maintaining dynamic minimum spanning trees: An experimental studyCATTANEO, Giuseppe; FARUOLO, Pompeo; FERRARO PETRILLO, Umberto et al.Lecture notes in computer science. 2002, pp 111-125, issn 0302-9743, isbn 3-540-43977-3, 15 p.Conference Paper

Minimum spanning tree-based random-valued impulse noise detection for a switching median filterTANAKA, Go; SUETAKE, Noriaki; UCHINO, Eiji et al.Optics letters. 2008, Vol 33, Num 17, pp 1993-1995, issn 0146-9592, 3 p.Article

Piecewise Linear Curve Approximation Using Graph Theory and Geometrical ConceptsKOUTROUMBAS, Konstantinos D.IEEE transactions on image processing. 2012, Vol 21, Num 9, pp 3877-3887, issn 1057-7149, 11 p.Article

Distributed verification of minimum spanning treesKORMAN, Amos; KUTTEN, Shav.ACM Symposium on Principles of Distributed Computing. 2006, pp 26-34, isbn 1-595-93384-0, 1Vol, 9 p.Conference Paper

Reconstruction of interior layout of building from through-the-wall radar image using MST-based methodBO CHEN; TIAN JIN; BIYING LU et al.Electronics letters. 2014, Vol 50, Num 9, pp 701-703, issn 0013-5194, 3 p.Article

Sensitivity Analysis of Euclidean Minimum Spanning TreeTOURNIER, N; PUECH, W; SUBSOL, G et al.Proceedings of SPIE, the International Society for Optical Engineering. 2010, Vol 7526, issn 0277-786X, isbn 0-8194-7919-5 978-0-8194-7919-8, 1Vol, 75260G.1-75260G.10Conference Paper

Distributed Spanner Construction in Doubling Metric SpacesDAMIAN, Mirela; PANDIT, Saurav; PEMMARAJU, Sriram et al.Lecture notes in computer science. 2006, pp 157-171, issn 0302-9743, isbn 3-540-49990-3, 1Vol, 15 p.Conference Paper

Semi-supervised manifold learning based on 2-fold weightsFU, M; LUO, B; KONG, M et al.IET computer vision (Print). 2012, Vol 6, Num 4, pp 348-354, issn 1751-9632, 7 p.Article

A graph-theoretical clustering method based on two rounds of minimum spanning treesCAIMING ZHONG; DUOQIAN MIAO; RUIZHI WANG et al.Pattern recognition. 2010, Vol 43, Num 3, pp 752-766, issn 0031-3203, 15 p.Article

A 2 + ε approximation algorithm for the k-MST problemARORA, Sanjeev; KARAKOSTAS, George.Mathematical programming. 2006, Vol 107, Num 3, pp 491-504, issn 0025-5610, 14 p.Article

Savings based ant colony optimization for the capacitated minimum spanning tree problemREIMANN, Marc; LAUMANNS, Marco.Computers & operations research. 2006, Vol 33, Num 6, pp 1794-1822, issn 0305-0548, 29 p.Article

Approximation schemes for degree-restricted MST and red-blue separation problemsARORA, Sanjeev; CHANG, Kevin.Algorithmica. 2004, Vol 40, Num 3, pp 189-210, issn 0178-4617, 22 p.Article

Automated Centreline Extraction of Neuronal Dendrite from Optical Microscopy Image StacksLIANG XIAO; FANBIAO ZHANG.Proceedings of SPIE, the International Society for Optical Engineering. 2010, Vol 7850, issn 0277-786X, isbn 978-0-8194-8380-5, 78502Q.1-78502Q.7Conference Paper

Minimum Spanning Tree Problem with Label Selection : Foundations of Computer Science - Mathematical Foundations and Apllications of Algorithms and Computer ScienceFUJIYOSHI, Akio; SUZUKI, Masakazu.IEICE transactions on information and systems. 2011, Vol 94, Num 2, pp 233-239, issn 0916-8532, 7 p.Article

How to Trim an MST : A 2-Approximation Algorithm for Minimum Cost Tree CoverFUJITO, Toshihiro.Lecture notes in computer science. 2006, pp 431-442, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Merging clustering algorithms in mobile ad hoc networksDAGDEVIREN, Orhan; ERCIYES, Kayhan; COKUSLU, Deniz et al.Lecture notes in computer science. 2005, pp 56-61, issn 0302-9743, isbn 3-540-30999-3, 1Vol, 6 p.Conference Paper

On Sorting, Heaps, and Minimum Spanning TreesNAVARRO, Gonzalo; PAREDES, Rodrigo.Algorithmica. 2010, Vol 57, Num 4, pp 585-620, issn 0178-4617, 36 p.Article

A fast distributed approximation algorithm for mkinimum spanning treesKHAN, Maleq; PANDURANGAN, Gopal.Lecture notes in computer science. 2006, pp 355-369, issn 0302-9743, isbn 3-540-44624-9, 1Vol, 15 p.Conference Paper

MST-based SOFM in hybrid robot architectureYUN, Seok-Min; CHOI, Jin-Young.Proceedings of SPIE, the International Society for Optical Engineering. 2005, pp 60423O.1-60423O.5, issn 0277-786X, isbn 0-8194-6074-5Conference Paper

Lossless 3D steganography based on MST and connectivity modificationAMAT, P; PUECH, W; DRUON, S et al.Signal processing. Image communication. 2010, Vol 25, Num 6, pp 400-412, issn 0923-5965, 13 p.Article

Nearly linear time minimum spanning tree maintenance for transient node failuresNARDELLI, Enrico; PROIETTI, Guido; WIDMAYER, Peter et al.Algorithmica. 2004, Vol 40, Num 2, pp 119-132, issn 0178-4617, 14 p.Article

An effective double-bounded tree-connected Isomap algorithm for microarray data classificationORSENIGO, C; VERCELLIS, C.Pattern recognition letters. 2012, Vol 33, Num 1, pp 9-16, issn 0167-8655, 8 p.Article

Distributed node-based transmission power control for wireless ad hoc networksBHATTACHARJEE, Subhasis; DAS, Nabanita.Lecture notes in computer science. 2006, pp 49-62, issn 0302-9743, isbn 3-540-68379-8, 1Vol, 14 p.Conference Paper

Efficient Hybrid Tree-Based Stereo Matching With Applications to Postcapture Image RefocusingVU, Dung T; CHIDESTER, Benjamin; HONGSHENG YANG et al.IEEE transactions on image processing. 2014, Vol 23, Num 7-8, pp 3428-3442, issn 1057-7149, 15 p.Article

Tree Filtering: Efficient Structure-Preserving Smoothing With a Minimum Spanning TreeLINCHAO BAO; YIBING SONG; QINGXIONG YANG et al.IEEE transactions on image processing. 2014, Vol 23, Num 1-2, pp 555-569, issn 1057-7149, 15 p.Article