Results 1 to 10 of about 35,371 (162)
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
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
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
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
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
Моделирование и анализ информационных систем, 2021 In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or (k +
Alexander Valeryevich Smirnov
doaj +1 more source
Determining hop-constrained spanning trees with repetitive heuristics
Journal of Telecommunications and Information Technology, 2023 The hop-constrained minimum spanning tree problem is the problem of determining a rooted spanning tree of minimum cost in which each path from the root node to any other node contains at most H hops or edges.
Manuela Fernandes +2 more
doaj +1 more source
Information and Telecommunication Sciences, 2023 Background. Whereas in many tasks of designing efficient telecommunication networks, the number of network nodes is limited, the initial choice of nodes is wider.
Вадим Романюк
doaj +1 more source