Essays about: "Spanning Tree"
Showing result 1 - 5 of 20 essays containing the words Spanning Tree.
-
1. Methods from Linear Algebra for the Enumeration of Spanning Trees
University essay from KTH/Skolan för teknikvetenskap (SCI)Abstract : In this report, we study the enumeration of spanning trees in graphs, using two methods withinlinear algebra, Kirchhoff’s Matrix Tree Theorem and an alternative method, also referred to asLemma 1, derived by S. Klee and M.T Stamps in [KS20]. READ MORE
-
2. Estimating Brain Maturation in Very Preterm Neonates : An Explainable Machine Learning Approach
University essay from KTH/Skolan för kemi, bioteknologi och hälsa (CBH)Abstract : Introduction: Assessing brain maturation in preterm neonates is essential for the health of the neonates. Machine learning methods have been introduced as a prospective assessment tool for neonatal electroencephalogram(EEG) signals. READ MORE
-
3. Mapping Disinformation : Analysing the diffusion network of fake news and fact-checks in Italy during the COVID19 pandemic
University essay from Uppsala universitet/Statsvetenskapliga institutionenAbstract : In recent years, disinformation circulating the internet and especially social media has become a widespread concern. The urgency of the fake news problem lies in the fact that decisions that are taken on false or misleading information risk impacting democratic processes negatively. READ MORE
-
4. Migration to P4-Programmable Switches and Implementation of the Rapid Spanning Tree Protocol
University essay from Linköpings universitet/Programvara och systemAbstract : P4 is a high-level language for programming the data plane of a network switch. These P4-programmable switches come with no pre-defined behavior or protocols, so it is entirely up to the loaded P4 program to define these. This allows the user to exclude any unwanted functionality and to create custom protocols. READ MORE
-
5. Parallel Minimum Cuts : An improved CREW PRAM algorithm
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple randomized CREW PRAM algorithm to find the minimum cut in a graph G with n nodes and m edges, based on Karger’s celebrated randomized near-linear time min-cut algorithm [STOC’96]. READ MORE