Results 11 to 20 of about 3,689,343 (292)
Optimasi Jaringan dengan Spanning Tree untuk Congestion Management [PDF]
ComTech, 2014 A proper network optimization is needed to deal with problems on the network and to minimize latency in the data flow in a dense network. The data stream is directed into the right channels so that the optimal network speed and latency can be minimized.
Mayliana Mayliana
doaj +2 more sources
Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparison [PDF]
, 2006 This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible.
Moreno, J A +3 more
core +7 more sources
Spanning k-Ended Tree in 2-Connected Graph
Axioms, 2023 Win proved a very famous conclusion that states the graph G with connectivity κ(G), independence number α(G) and α(G)≤κ(G)+k−1(k≥2) contains a spanning k-ended tree. This means that there exists a spanning tree with at most k leaves.
Wanpeng Lei, Jun Yin
doaj +1 more source
The Minimum Moving Spanning Tree Problem
Journal of Graph Algorithms and Applications, 2023 We investigate the problem of finding a spanning tree of a set of $n$ moving points in $\mathbb{R}^{\dim}$ that minimizes the maximum total weight (under any convex distance function) or the maximum bottleneck throughout the motion.
Hugo Akitaya +6 more
doaj +1 more source
Linear algebraic techniques for weighted spanning tree enumeration [PDF]
Linear Algebra and its Applications, 2019 The weighted spanning tree enumerator of a graph G with weighted edges is the sum of the products of edge weights over all the spanning trees in G. In the special case that all of the edge weights equal 1, the weighted spanning tree enumerator counts the
S. Klee, Matthew T. Stamps
semanticscholar +1 more source
Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning [PDF]
Neutrosophic Sets and Systems, 2020 In this paper, we first define the Neutrosophic tree using the concept of the strong cycle. We then define a strong spanning Neutrosophic tree. In the following, we propose an algorithm for detecting the maximum spanning tree in Neutrosophic graphs. Next,
Masoud Ghods, Zahra Rostami
doaj +1 more source
Patria Artha Technological Journal, 2022 Sebagai salah satu jenis UKM dibidang kuliner, Thai Tea Azka dihadapkan dengan berbagai persoalan optimalisasi manajemen sumber daya. Dalam persoalan penugasan karyawan Thai Tea Azka mengalami kendala dalam penempatan tiap karyawan karena belum memiliki ...
Fauzan As Habi +2 more
doaj +1 more source
An almost-linear time algorithm for uniform random spanning tree generation [PDF]
Symposium on the Theory of Computing, 2017 We give an m1+o(1)βo(1)-time algorithm for generating uniformly random spanning trees in weighted graphs with max-to-min weight ratio β. In the process, we illustrate how fundamental tradeoffs in graph partitioning can be overcome by eliminating vertices
Aaron Schild
semanticscholar +1 more source
Clustered Spanning Tree - Conditions for Feasibility [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Let H =< V, S > be a hypergraph, where V is a set of vertices and S is a set of not necessarily disjoint clusters Si ⊆ V. The Clustered Spanning Tree problem is to find a spanning tree of G which satisfies that each cluster induces a subtree, when it ...
Nili Guttmann-Beck +2 more
doaj +1 more source
Planar bichromatic bottleneck spanning trees
Journal of Computational Geometry, 2021 Given a set $P$ of red and blue points in the plane, a planar bichromatic spanning tree of $P$ is a geometric spanning tree of $P$, such that each edge connects a red and a blue point, and no two edges intersect.
Karim Abu-Affash +3 more
doaj +1 more source