Results 21 to 30 of about 43,946 (309)
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
Balanced Partition of Minimum Spanning Trees [PDF]
International Journal of Computational Geometry & Applications, 2002 To better handle situations where additional resources are available to carry out a task, many problems from the manufacturing industry involve dividing a task into a number of smaller tasks, while optimizing a specific objective function. In this paper we consider the problem of partitioning a given set [Formula: see text] of n points in the plane ...
Mattias Andersson 0002 +3 more
openaire +4 more sources
Degree-Constrained k-Minimum Spanning Tree Problem
Complexity, 2020 Let GV,E be a simple undirected complete graph with vertex and edge sets V and E, respectively. In this paper, we consider the degree-constrained k-minimum spanning tree (DCkMST) problem which consists of finding a minimum cost subtree of G formed with ...
Pablo Adasme, Ali Dehghan Firoozabadi
doaj +1 more source
The Stackelberg Minimum Spanning Tree Game [PDF]
Algorithmica, 2007 v3: Referees' comments incorporated. A preliminary version appeared in the proceedings of the 10th Workshop on Algorithms and Data Structures (WADS 2007)
Jean Cardinal +6 more
openaire +7 more sources
MENCARI MINIMUM SPANNING TREE DENGAN KONSTREN
Jurnal Matematika UNAND, 2019 Misalkan G = (V, E) adalah graf tak berarah terhubung yang bukan tree, berarti di G terdapat cycle. Dengan cyclic interchange maka diperoleh subgraf T yang tidak memuat cycle. Subgraf T inilah yang dinamakan dengan spanning tree.
Miftahul Jannah +2 more
doaj +1 more source
An optimal minimum spanning tree algorithm [PDF]
Journal of the ACM, 2000 We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to find a minimum spanning tree of a graph with n vertices and m edges that runs in time O (
Seth Pettie, Vijaya Ramachandran
openaire +1 more source
Edge-Preserving Stereo Matching Using Minimum Spanning Tree
IEEE Access, 2019 Despite that the accuracy and efficiency of stereo matching technology have significantly improved in the past decades, the issue of edge-blurring remains a challenge to most of the existing approaches.
Congxuan Zhang +5 more
doaj +1 more source
Minimum spanning tree analysis for epilepsy magnetoencephalography (MEG) data
Exploration of Neuroprotective Therapy, 2023 Aim: Recently, brain network research is actively conducted through the application of graph theory. However, comparison between brain networks is subject to bias issues due to topological characteristics and heterogeneity across subjects.
Sunhan Shin, Chun Kee Chung, Jaehee Kim
doaj +1 more source
The Spanning Tree of a Divisible Multiple Graph
Моделирование и анализ информационных систем, 2018 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.
Alexander V. Smirnov
doaj +1 more source