Bounded-Angle Minimum Spanning Trees

Algorithmica ◽

10.1007/s00453-021-00889-6 ◽

2021 ◽

Author(s):

Ahmad Biniaz ◽

Prosenjit Bose ◽

Anna Lubiw ◽

Anil Maheshwari

Keyword(s):

Spanning Trees ◽

Minimum Spanning Trees

Download Full-text

Parallel Update of Minimum Spanning Trees in Logarithmic Time.

10.21236/ada150497 ◽

1984 ◽

Cited By ~ 1

Author(s):

I. V. Ramakrishnan ◽

S. Pawagi

Keyword(s):

Spanning Trees ◽

Minimum Spanning Trees

Download Full-text

Identification of Dementia Related Brain Functional Networks with Minimum Spanning Trees

2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) ◽

10.1109/bibm49941.2020.9313223 ◽

2020 ◽

Author(s):

Abdulyekeen. T. Adebisi ◽

Venkateswarlu Gonuguntla ◽

Ho-Won Lee ◽

Kalyana. C. Veluvolu

Keyword(s):

Spanning Trees ◽

Functional Networks ◽

Minimum Spanning Trees ◽

Brain Functional Networks

Download Full-text

A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees

ACM Transactions on Algorithms ◽

10.1145/3365005 ◽

2020 ◽

Vol 16 (1) ◽

pp. 1-27

Author(s):

Gopal Pandurangan ◽

Peter Robinson ◽

Michele Scquizzato

Keyword(s):

Distributed Algorithm ◽

Spanning Trees ◽

Minimum Spanning Trees

Download Full-text

Adaptive hyperlinks using page access sequences and minimum spanning trees

2007 IEEE International Fuzzy Systems Conference ◽

10.1109/fuzzy.2007.4295422 ◽

2007 ◽

Cited By ~ 2

Author(s):

Pawan Lingras ◽

Rucha Lingras

Keyword(s):

Spanning Trees ◽

Minimum Spanning Trees

Download Full-text

A novel approach to multiple constant multiplication using minimum spanning trees

The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002. ◽

10.1109/mwscas.2002.1187124 ◽

2003 ◽

Cited By ~ 20

Author(s):

O. Gustafsson ◽

L. Wanhammar

Keyword(s):

Spanning Trees ◽

Minimum Spanning Trees ◽

Novel Approach ◽

Constant Multiplication

Download Full-text

A linear-time optimal-message distributed algorithm for minimum spanning trees

Distributed Computing ◽

10.1007/s00446-004-0107-2 ◽

2004 ◽

Vol 17 (2) ◽

Cited By ~ 9

Author(s):

Michalis Faloutsos ◽

Mart Molle

Keyword(s):

Distributed Algorithm ◽

Spanning Trees ◽

Linear Time ◽

Minimum Spanning Trees ◽

Time Optimal

Download Full-text

Urban Network Analysis by Random Graphs and the Estimate of the Length of Minimum Spanning Trees

Journal of the City Planning Institute of Japan ◽

10.11361/journalcpij.20.97 ◽

1985 ◽

Vol 20 (0) ◽

pp. 97-102

Author(s):

Masao Furuyama

Keyword(s):

Network Analysis ◽

Random Graphs ◽

Spanning Trees ◽

Minimum Spanning Trees ◽

Urban Network

Download Full-text

Maintaining minimum spanning trees in dynamic graphs

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-63165-8_214 ◽

1997 ◽

pp. 594-604 ◽

Cited By ~ 23

Author(s):

Monika R. Henzinger ◽

Valerie King

Keyword(s):

Spanning Trees ◽

Minimum Spanning Trees ◽

Dynamic Graphs

Download Full-text

Dynamic Euclidean minimum spanning trees and extrema of binary functions

Discrete & Computational Geometry ◽

10.1007/bf02574030 ◽

1995 ◽

Vol 13 (1) ◽

pp. 111-122 ◽

Cited By ~ 41

Author(s):

D. Eppstein

Keyword(s):

Spanning Trees ◽

Minimum Spanning Trees ◽

Euclidean Minimum Spanning Trees ◽

Binary Functions

Download Full-text

The realization problem for Euclidean minimum spanning trees is NP-hard

Proceedings of the tenth annual symposium on Computational geometry - SCG '94 ◽

10.1145/177424.177507 ◽

1994 ◽

Cited By ~ 14

Author(s):

Peter Eades ◽

Sue Whitesides

Keyword(s):

Spanning Trees ◽

Minimum Spanning Trees ◽

Np Hard ◽

Realization Problem ◽

Euclidean Minimum Spanning Trees

Download Full-text