Results 1 to 10 of about 186,232 (291)
Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants [PDF]
Data in Brief, 2023 This article proposes a benchmark instance generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants. The generator is developed in C++ and does not uses external
Iago A. Carvalho, Amadeu A. Coco
doaj +2 more sources
Alzheimer Classification Using a Minimum Spanning Tree of High-Order Functional Network on fMRI Dataset [PDF]
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 +2 more sources
Some models for inverse minimum spanning tree problem with uncertain edge weights [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2022 The inverse minimum spanning tree (IMST) problem is an inverse optimization problem in which one makes the least modification to the edge weights of a predetermined spanning tree, to make it the minimum spanning tree with respect to new edge weights ...
Sagarika Biswal, Ganesh Ghorai
doaj +1 more source
Successive minimum spanning trees [PDF]
Random Structures & Algorithms, 2021 AbstractIn a complete graphwith independent uniform(or exponential) edge weights, letbe the minimum‐weight spanning tree (MST), andthe MST after deleting the edges of all previous trees. We show that each tree's weightconverges in probability to a constant, with, and we conjecture that.
Janson, Svante, Sorkin, Gregory B.
openaire +6 more sources
Involve, a Journal of Mathematics, 2009 GTC has been assigned the job of interconnecting six departments, labeled A, B, C, D, E, and F, of a university, at minimum cost. Practical considerations make it impossible to connect several pairs of departments directly to one another. In fact the only direct connections possible are the ones between departments A and B, A and D, B and C, B and D, B
Gerard Sierksma, Diptesh Ghosh
+5 more sources
Kubik, 2021 Penelitian ini membahas tentang penyelesaian masalah transportasi dengan pendekatan Minimum Spanning Tree (MST) menggunakan algoritma Kruskal dan algoritma Prim untuk mencari solusi optimal.
Yusufiani Nurlinawati Dili +2 more
doaj +1 more source
Diameter Constrained Fuzzy Minimum Spanning Tree Problem [PDF]
International Journal of Computational Intelligence Systems, 2013 In this paper, we have studied the constrained version of the fuzzy minimum spanning tree problem. Costs of all the edges are considered as fuzzy numbers.
Sk. Md. Abu Nayeem, Madhumangal Pal
doaj +1 more source
Efficient and Effective Directed Minimum Spanning Tree Queries
Mathematics, 2023 Computing directed Minimum Spanning Tree (DMST) is a fundamental problem in graph theory. It is applied in a wide spectrum of fields from computer network and communication protocol design to revenue maximization in social networks and syntactic parsing ...
Zhuoran Wang +4 more
doaj +1 more source
Brain Tumor Segmentation Based on Minimum Spanning Tree
Frontiers in Signal Processing, 2022 In this paper, we propose a minimum spanning tree-based method for segmenting brain tumors. The proposed method performs interactive segmentation based on the minimum spanning tree without tuning parameters.
Simeon Mayala +9 more
doaj +1 more source
Minimum Spanning Tree Cycle Intersection problem [PDF]
Discrete Applied Mathematics, 2021 Consider a connected graph $G$ and let $T$ be a spanning tree of $G$. Every edge $e \in G-T$ induces a cycle in $T \cup \{e\}$. The intersection of two distinct such cycles is the set of edges of $T$ that belong to both cycles. We consider the problem of finding a spanning tree that has the least number of such non-empty intersections.
Manuel Dubinsky +2 more
openaire +4 more sources