Results 51 to 60 of about 4,149 (163)
Infinity Jurnal Matematika dan Aplikasinya, 2020 Penelitian ini bertujuan untuk menentukan pohon merentang minimum (Minimum Spanning Tree) terhadap lintasan yang mengarah ke Pusat Perbelanjaan di Kota Palopo menggunakan Algoritma Semut.
Fatimah Fatimah, Marwan Sam
doaj
Minimum Diameter Spanning Tree
American Journal of Computational Mathematics, 2018 In this paper, we discuss the simple connected graphs which have a minimum diameter spanning tree such that both have same domination number.
V. T. Chandrasekaran, N. Rajasri
openaire +2 more sources
Frontiers in Neuroscience, 2017 Functional magnetic resonance imaging (fMRI) is one of the most useful methods to generate functional connectivity networks of the brain. However, conventional network generation methods ignore dynamic changes of functional connectivity between brain ...
Hao Guo +5 more
doaj +1 more source
Real‐Time Forecast of Influenza Outbreak Using Dynamic Network Marker Based on Minimum Spanning Tree [PDF]
, 2020 Kun Yang +5 more
openalex +1 more source
Micro-cluster Structure Clustering Based on Weight-Constrained Minimum Spanning Tree
Data Science and EngineeringCurrently, it is a challenging problem to make clustering algorithms suitable for arbitrary distributions of data. In this paper, we propose a Micro-cluster Structure Clustering algorithm based on the Weight-constrained Minimum Spanning Tree, called MSC ...
Jiaman Ding +3 more
doaj +1 more source
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2018 This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method.
Dewi Suhika, Wamiliana Wamiliana
doaj +1 more source
The Diameter of the Minimum Spanning Tree of a Complete Graph [PDF]
, 2006 Louigi Addario‐Berry +2 more
openalex +1 more source
Average Case Analysis of the MST-heuristic for the Power Assignment Problem: Special Cases
EAI Endorsed Transactions on Energy Web, 2016 We present an average case analysis of the minimum spanning tree heuristic for the power assignment problem. The worst-case approximation ratio of this heuristic is 2.
Maurits de Graaf +3 more
doaj +1 more source
Solving degree constrained minimum spanning tree problem based on improved fireworks algorithm
, 2022 Zunhai Gao, Chengpeng Gui, Yi Liu
openalex +1 more source
The capacitated minimum spanning tree problem [PDF]
, 2013 Héctor Efraín Ruiz y Ruiz
openalex +1 more source