Results 21 to 30 of about 309,634 (292)

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

On Minimum Average Stretch Spanning Trees in Polygonal 2-trees [PDF]

, 2014
A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges.
Narayanaswamy, N. S., Ramakrishna, G.
core   +1 more source

Spanning tree protokol

Polytechnic and Design, 2019
A campus network is an enterprise network that consist of many connected LANs that are all usually in the same geographic area. According to the Network Hierarchy, a campus network has three separated layers - Access Layer, Distribution Layer and Core Layer.
Jelečki, Nikola, Turkalj, Vedran
openaire   +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, Luis Gouveia, Stefan Voß   +2 more
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

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

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

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, Ida Herdlevær, Ida Herdlevær, Jonas Bull Haugsøen, Jonas Bull Haugsøen, Shamundeeswari Anandan, Shamundeeswari Anandan, Sonia Gavasso, Sonia Gavasso, Morten Brun   +9 more
doaj   +1 more source

Implementasi VLAN dan Spanning Tree Protocol Menggunakan GNS 3 dan Pengujian Sistem Keamanannya

Khazanah Informatika, 2018
Pada saat ini, jaringan komputer telah banyak digunakan dalam berbagai macam bidang dan telah mengalami perkembangan yang sangat pesat. Hampir setiap perusahaan atau organisasi menggunakan jaringan komputer.
Wahyu Saputra, Fajar Suryawan
doaj   +1 more source

Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties

Sensors, 2021
For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes.
Jianhua Lyu, Yiran Ren, Zeeshan Abbas, Baili Zhang   +3 more
doaj   +1 more source