Results 11 to 20 of about 4,149 (163)

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, Luis Gouveia, Stefan Voß   +2 more
doaj   +1 more source

PRUNING MINIMUM SPANNING TREES AND CUTTING LONGEST EDGES TO CONNECT A GIVEN NUMBER OF NODES BY MINIMIZING TOTAL EDGE LENGTH

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

Bounded-Angle Minimum Spanning Trees

Algorithmica, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari   +3 more
openaire   +3 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

Generalized minimum spanning tree games

EURO Journal on Computational Optimization, 2016
The minimum-cost spanning tree game is a special class of cooperative games defined on a graph with a set of vertices and a set of edges, where each player owns a vertex. Solutions of the game represent ways to distribute the total cost of a minimum-cost
PhuocHoang Le, Tri-Dung Nguyen, Tolga Bektaş   +2 more
doaj   +1 more source

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, Narwen Narwen, Bukti Ginting   +2 more
doaj   +1 more source

Minimum Restricted Diameter Spanning Trees

Discrete Applied Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hassin, Refael, Levin, Asaf
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, Chao He, Zhen Chen, Wen Liu, Ming Li, Junjie Wu   +5 more
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

Spanning trees with small diameters

AKCE International Journal of Graphs and Combinatorics, 2020
A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj   +1 more source