Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 327 for “"spanning tree"”.

  1. Modelování a simulace spanning-tree protokolů

    Táto diplomová práca sa zaoberá funkcionalitou Spanning Tree protokolov, predovšetkým pre protokoly Rapid Spanning Tree Protocol a Multiple Spanning Tree Protocol. Spanning tree protokoly sa predovšetkým používajú pre prevenciu slučiek v rámci vrstvy dátového spoja, prevenciu broadcast storm a tiež …

    brno-tech Repository record for Modelování a simulace spanning-tree protokolů (opens in a new tab)

  2. Spanning Tree Representation of High Dimensional Data

    … single-cell genomic data, ordering cells in a spanning tree with multiple branches is a useful way to study the dynamic activities of genes along the biological process. Few methods are available for cells from a complex developmental process with branches. We propose a method that uses …

    jhu Repository record for Spanning Tree Representation of High Dimensional Data (opens in a new tab)

  3. Computing a Diameter-constrained Minimum Spanning Tree

    … it is necessary to find the smallest possible tree with a bounded diameter. A diameter-constrained minimum spanning tree (DCMST) of a given undirected, edge-weighted graph, G, is the smallest-weight spanning tree of all spanning trees of G which contain no path with more than k edges, where k …

    ucf Repository record for Computing a Diameter-constrained Minimum Spanning Tree (opens in a new tab)

  4. Tree Graphs and Orthogonal Spanning Tree Decompositions

    Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as …

    portland-state Repository record for Tree Graphs and Orthogonal Spanning Tree Decompositions (opens in a new tab)

  5. Parallel Implementation of a Minimum Spanning Tree Algorithm

    Building a Minimum Spanning Tree (MST) of a weighted undirected graph is an important step in various applications, including circuit design, and it is desirable to build the MST quickly. However, current well-known approaches for building MSTs are not highly parallel. In this thesis, I propose a …

    texas-state Repository record for Parallel Implementation of a Minimum Spanning Tree Algorithm (opens in a new tab)

  6. Bayesian Spanning Tree Models for Complex Spatial Data

    … finite number of spatial locations using random spanning trees (RSTs) of a spatial graph, which guarantees contiguity in clustering and allows to detect clusters with arbitrary shapes and sizes. We embed this model within a hierarchical modeling framework to estimate spatially clustered …

    tamu Repository record for Bayesian Spanning Tree Models for Complex Spatial Data (opens in a new tab)

  7. On the shortest path and minimum spanning tree problems

    The shortest path and minimum spanning tree problems are two of the classic textbook problems in combinatorial optimization. They are simple to describe and admit simple polynomial-time algorithms. However, despite years of concerted research effort, the asymptotic complexity of these problems …

    texas Repository record for On the shortest path and minimum spanning tree problems (opens in a new tab)

  8. The Minimum Labeling Spanning Tree Problem and Some Variants

    … disseration topic is the minimum labeling spanning tree (MLST) problem and some variants, including the label-constrained minimum spanning tree (LC-MST) problem and the colorful travaling salesman problem (CTSP). All of the three problems are NP-hard. The MLST problem tries to find a …

    maryland Repository record for The Minimum Labeling Spanning Tree Problem and Some Variants (opens in a new tab)

  9. On the independent spanning tree conjectures and related problems

    We say that trees with common root are (edge-)independent if, for any vertex in their intersection, the paths to the root induced by each tree are internally (edge-)disjoint. The relationship between graph (edge-)connectivity and the existence of (edge-)independent spanning trees is explored. The …

    gatech Repository record for On the independent spanning tree conjectures and related problems (opens in a new tab)

  10. Distributed broadcast and minimum spanning tree algorithms with low communication complexity

    … consider the problems of broadcast and minimum spanning tree construction in a distributed setting. These problems are of fundamental importance. Efficient solutions for these problems can lead to improvements in algorithms for a number of other distributed problems such as leader election. …

    uvic Repository record for Distributed broadcast and minimum spanning tree algorithms with low communication complexity (opens in a new tab)

  11. A Performance Analysis of the Meshed Tree Protocol and the Rapid Spanning Tree Protocol

    … networks to avoid broadcast storms. Logical Spanning Trees are constructed on the physical meshed topologies to overcome this issue and preserve the stability of the network. However, during topology changes as the result of a failure, frame forwarding latency or frame loss is introduced when …

    rit Repository record for A Performance Analysis of the Meshed Tree Protocol and the Rapid Spanning Tree Protocol (opens in a new tab)

Page 1 of 17