Results 81 to 90 of about 248,790 (377)
OPTIMALISASI RENCANA PEMASANGAN KABEL FIBER OPTIC DI ITERA DENGAN ALGORITMA PRIM
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2020 Kabel fiber optic (FO) digunakan sebagai tulang punggung jaringan komputer Institut Teknologi Sumatera (ITERA). Salah satu perencaannya adalah dengan mengukur jarak antar gedung yang akan ditarik kabel FO.
Dewi Suhika +2 more
doaj +1 more source
Complex, 2017 A large number of studies demonstrated that major depressive disorder (MDD) is characterized by the alterations in brain functional connections which is also identifiable during the brain’s “resting-state.” But, in the present study, the approach of ...
Xiaowei Li +10 more
semanticscholar +1 more source
The capacitated minimum spanning tree problem
, 2023 In this thesis we focus on the Capacitated Minimum Spanning Tree (CMST), an extension of the minimum spanning tree (MST) which considers a central or root vertex which receives and sends commodities (information, goods, etc) to a group of terminals. Such commodities flow through links which have capacities that limit the total flow they can accommodate.
openaire +4 more sources
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 +3 more sources
Advanced Functional Materials, EarlyView.Walnut seeds are enclosed in a remarkably strong shell made of sclerenchyma, separated by a pectin‐rich suture tissue. Different cell shapes and chemical composition of this tissue point to an opening mechanism, which is triggered by cyclic humidity changes.
Sebastian J. Antreich +3 more
wiley +1 more source
Bipolar Neutrosophic Minimum Spanning Tree
, 2018 The aim of this article is to introduce a matrix algorithm for finding minimum spanning tree (MST) in the environment of undirected bipolar neutrosophic connected graphs (UBNCG).
S. Broumi +4 more
semanticscholar +1 more source
Robust and minimum spanning tree in fuzzy environment
International Journal of Computing Science and Mathematics, 2019 This paper proposes an algorithm to find the fuzzy minimum spanning tree (FMST) of an undirected weighted fuzzy graph, in which mixed fuzzy numbers, either triangular or trapezoidal, are used to represent the lengths/costs of the arcs.
Arindam Dey, Sahanur Mondal, T. Pal
semanticscholar +1 more source
Minimum spanning tree filtering of correlations for varying time scales and size of fluctuations. [PDF]
Physical Review E, 2016 Based on a recently proposed q-dependent detrended cross-correlation coefficient, ρ_{q} [J. Kwapień, P. Oświęcimka, and S. Drożdż, Phys. Rev. E 92, 052815 (2015)PLEEE81539-375510.1103/PhysRevE.92.052815], we generalize the concept of the minimum spanning
J. Kwapień +3 more
semanticscholar +1 more source
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size [PDF]
, 2001 Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster.
Kern, W., Pop, P.C., Still, G.J.
core +1 more source
Advanced Healthcare Materials, EarlyView.This study reveals how vorticity—a swirling flow pattern—enhances platelet aggregation and thrombus formation in high‐shear conditions. Using a custom microfluidic model, it is shows that vorticity promotes vWF–GPIbα interactions and calcium signaling, providing new insights into thrombosis mechanobiology and informing safer blood‐contacting medical ...
Jianfang Ren +13 more
wiley +1 more source