Results 31 to 40 of about 1,374,964 (300)
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
Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
Electronic Journal of Graph Theory and Applications, 2016 This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs $K_m+H_n$ and $K_m+K_{n,p}$, where $H_n$ is a graph with $n$ isolated vertices.
Sung Sik U
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
Ramsey Spanning Trees and Their Applications [PDF]
ACM Transactions on Algorithms, 2018 The metric Ramsey problem asks for the largest subset S of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem.
Ittai Abraham +4 more
openaire +4 more sources
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
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
Computational Geometry, 2014 Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric spanning tree of S. In this work, we study the problem of finding a second plane geometric tree T' spanning S, such that is compatible with T and ...
Garcia Olaverri, Alfredo Martin +3 more
openaire +3 more sources
Breaking intractability of spanning caterpillar tree problem: A logical approach [PDF]
AUT Journal of Mathematics and Computing, 2022 In this paper we pursue a logical approach to prove that the optimisation problem of finding a spanning caterpillar tree in a graph has polynomial algorithm for bounded tree width graphs.
Masoud Khosravani
doaj +1 more source
Chain-Constrained Spanning Trees [PDF]
Mathematical Programming, 2013 We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as ...
Neil Olver, Rico Zenklusen
openaire +8 more sources
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