Results 11 to 20 of about 2,238,100 (388)
UHD Journal of Science and TechnologyThis paper examines the concepts and practical applications of the spanning tree protocol (STP). It also covers per-VLAN spanning tree (PVST), multiple spanning tree (MST), and rapid STP (RSTP).
Dana Faiq Abd +3 more
doaj +3 more sources
Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO). [PDF]
Magn Reson Med, 2021 Purpose To develop a rapid and accurate MRI phase unwrapping technique for challenging phase topographies encountered at high magnetic fields, around metal implants or post-operative cavities, that is sufficiently fast to be applied to large group ...
Dymerska B +6 more
europepmc +2 more sources
Pruning a minimum spanning tree [PDF]
Physica A: Statistical Mechanics and its Applications, 2012 This work employs some techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The first technique establishes a threshold above which connections are considered affected by noise, based on the ...
L. Sandoval
openaire +3 more sources
Gaussian approximation for rooted edges in a random minimal directed spanning tree [PDF]
Random Struct. Algorithms, 2021 We study the total α$$ \alpha $$ ‐powered length of the rooted edges in a random minimal directed spanning tree — first introduced in Bhatt and Roy (2004) — on a Poisson process with intensity s≥1$$ s\ge 1 $$ on the unit cube [0,1]d$$ {\left[0,1\right ...
M. Aljada +8 more
semanticscholar +1 more source
Some models for inverse minimum spanning tree problem with uncertain edge weights [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2022 The inverse minimum spanning tree (IMST) problem is an inverse optimization problem in which one makes the least modification to the edge weights of a predetermined spanning tree, to make it the minimum spanning tree with respect to new edge weights ...
Sagarika Biswal, Ganesh Ghorai
doaj +1 more source
The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph [PDF]
MATEC Web of Conferences, 2021 Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins.
Paryati, Salahddine Krit
doaj +3 more sources
Minimum spanning tree analysis of the human connectome. [PDF]
Hum Brain Mapp, 2018 One of the challenges of brain network analysis is to directly compare network organization between subjects, irrespective of the number or strength of connections.
van Dellen E +11 more
europepmc +2 more sources
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
Моделирование и анализ информационных систем, 2021 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. Each edge of the last two types is a union of k linked edges, which connect 2 or (k +
Alexander Valeryevich Smirnov
doaj +1 more source
Alzheimer Classification Using a Minimum Spanning Tree of High-Order Functional Network on fMRI Dataset. [PDF]
Front Neurosci, 2017 Functional magnetic resonance imaging (fMRI) is one of the most useful methods to generate functional connectivity networks of the brain. However, conventional network generation methods ignore dynamic changes of functional connectivity between brain ...
Guo H, Liu L, Chen J, Xu Y, Jie X.
europepmc +2 more sources
Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree) [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2014 Wireless Sensors Networks (WSNs) are utilized in many diverse applications ranging from security, environmental monitoring, landslide detection, patient monitoring, reconnaissance operations, structural health monitoring and smart buildings.
Lifford McLauchlan +2 more
doaj +1 more source