Sökning: "spanning tree"

Visar resultat 1 - 5 av 24 uppsatser innehållade orden spanning tree.

  1. 1. Methods from Linear Algebra for the Enumeration of Spanning Trees

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Nils Forsgren; [2023]
    Nyckelord :Spanning Tree Enumeration;

    Sammanfattning : 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]. LÄS MER

  3. 2. Estimating Brain Maturation in Very Preterm Neonates : An Explainable Machine Learning Approach

    Master-uppsats, KTH/Skolan för kemi, bioteknologi och hälsa (CBH)

    Författare :Patrik Svensson; [2023]
    Nyckelord :Preterm Neonates; Brain Maturation; aEEG; Explainable Machine Learning; Feature Importance;

    Sammanfattning : 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. LÄS MER

  4. 3. Mapping Disinformation : Analysing the diffusion network of fake news and fact-checks in Italy during the COVID19 pandemic

    Master-uppsats, Uppsala universitet/Statsvetenskapliga institutionen

    Författare :Laura Giorio; [2021]
    Nyckelord :fake news; disinformation; fact-checking; social network analysis; diffusion network;

    Sammanfattning : 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. LÄS MER

  5. 4. Migration to P4-Programmable Switches and Implementation of the Rapid Spanning Tree Protocol

    Master-uppsats, Linköpings universitet/Programvara och system

    Författare :Henrik Lindström; [2020]
    Nyckelord :P4; Switch; Hybrid; SDN; Ethernet; Migration; RSTP; STP; Rapid; Spanning; Tree; BMv2;

    Sammanfattning : 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. LÄS MER

  7. 5. Parallel Minimum Cuts : An improved CREW PRAM algorithm

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Andrés López Martínez; [2020]
    Nyckelord :;

    Sammanfattning : 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]. LÄS MER