NDLTD logo NDLTD Union Catalog and Global ETD Search

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 76 for “"spanning tree"”.

  1. Time optimal self-stabilizing spanning tree algorithms

    Aggarwal, Sudhanshu MadanMassachusetts Institute of Technology1994

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.

    mit Repository record

  2. Spanning Tree Algorithms for Connectivity and Routing in Communication Networks

    Das, Bevan NarayanUniversity of Illinois at Urbana-Champaign2015

    U of I Only

    uiuc Repository record

  3. Random walk on uniform spanning tree and loop-erased random walk

    Satomi, WatanabeKyoto University2024

    kyoto Repository record

  4. A hybrid technique using minimal spanning tree and analytic hierarchical process to improve functional requirements prioritization

    Yaseen, MuhammadUniversiti Tun Hussein Onn Malaysia2021

    … a hybrid prioritization technique of Minimal Spanning Trees (MST) and AHP called the Spanning Analytic Hierarchical Process (SAHP) for FRs prioritization by exploiting MST capability to prioritize large size software FRs with smaller pairwise comparisons but with more consistent results. Using …

    uthm Repository record

  5. Approximating Average Bounded-Angle Minimum Spanning Trees

    Devaney, Patrick StephenUniversity of Windsor2023

    … networks, we study average bounded-angle minimum spanning trees. Let P be a set of points in the plane and let α be an angle. An α-spanning tree (α-ST) of P is a spanning tree of the complete Euclidean graph induced by P with the restriction that all edges incident to each point p in P lie in a …

    windsor Repository record

  6. Self-stabilizing network orientation algorithms in arbitrary rooted networks

    Gurumurthy, Shivashankar

    … The second protocol is designed on an underlying spanning tree protocol and stabilizes in O(h) time, after the spanning tree is constructed, where h is the height of the spanning tree. Although the second protocol assumes the existence of a spanning tree of the rooted network, it orients all …

    unlv Repository record

  7. Twisting bordered Khovanov homology

    Duong, Nguyen DatUniversity of Alabama Libraries2015

    … equivalent to a type D structure supported on spanning tree generators. We also describe how to twist Roberts's type A structure for a left tangle in such a way that pairing our type A and type D structures will result in the totally twisted Khovanov homology. Analogous to the type D structure, …

    alabama Repository record

  8. Mechanisms for quality-of-service provisioning in networks with extended services

    Qin, Zhen

    … the contrary, the alternative algorithm, single spanning tree dissemination, may not be able to achieve fast convergence or reliability. In the proposed new scheme, Per-Hop pArtial-Spanning Tree Adjust (PASTA) for dissemination, link states can be distributed with low overhead and fast speed, and …

    njit Repository record

  9. New techniques for geographic routing

    Leong, Ben Wing LupMassachusetts Institute of Technology2006

    … for geographic routing: Greedy Distributed Spanning Tree Routing (GDSTR) and Greedy Embedding Spring Coordinates (GSpring). Unlike previous geographic routing algorithms which require the planarization of the network connectivity graph, GDSTR switches to routing on a spanning tree instead of …

    mit Repository record

  10. Contribución a la distribución de contenidos multimedia sobre redes peer-to-peer

    Mozo Velasco, Bonifacio AlbertoTelecomunicacion2004

    … same topology, being the content distribution spanning tree topology a subset of the control network one. The spanning tree building is simple, but forces intermedíate nodes not interested in the reception of the muhimedia stream, to particípate in the spanning tree. In a fully heterogeneous …

    upm Repository record

  11. On the Design, Analysis, and Implementation of Algorithms for Selected Problems in Graphs and Networks

    Williamson, Matthew D.2018

    … in network optimization, viz., the minimum spanning tree verification (MSTV) problem, the undirected negative cost cycle detection (UNCCD) problem, and the negative cost girth (NCG) problem. These problems find applications in several domains including program verification, proof theory, …

    wvu Repository record

  12. Graph Theory for the Secondary School Classroom.

    Smithers, Dayna Brown2005

    … in Graph Theory, namely Vertex Coloring, Minimum Spanning Tree, Domination, and Hamiltonian Paths and Cycles, which are appropriate for high school level.</p>

    etsu Repository record

  13. SIMNET, a primal Simplex code for networks

    Banner, Michael C.

    … of networks, essential to the algorithm, is the spanning tree characterization of the basis. The Simplex Method pivots from one basic feasible solution, or spanning tree, to another until optimality is reached. The basis tree provides a unique relationship between the basic variables and the …

    eastern-wash Repository record

  14. Optimizing safety stock placement in general network supply chains

    Lesnaia, Ekaterina.Massachusetts Institute of Technology2004

    … generate the lower bounds, we create and solve a spanning-tree relaxation of the general-network problem. We provide a polynomial algorithm to solve these spanning tree problems. We perform a set of computational experiments to assess the performance of the general-network algorithm and to …

    mit Repository record

  15. Fast Parallel Algorithms and Library for Spatial Clustering and Computational Geometry

    Wang, YiqiuMassachusetts Institute of Technology2023

    … DBSCAN (HDBSCAN) and Euclidean minimum spanning tree (EMST), including several theoretical results and practical optimizations. Furthermore, we propose a method to generate a dendrogram from the minimum spanning tree (MST) of the HDBSCAN or EMST problem. The EMST also solves …

    mit Repository record

  16. Applications of Geometric and Spectral Methods in Graph Theory

    Nelsen, Lauren Morey2019

    … about properties of graphs. A rainbow spanning tree in an edge-colored graph is a spanning tree in which each edge is a different color. Carraher, Hartke, and Horn showed that for <em>n</em> and <em>C</em> large enough, if <em>G</em> is an edge-colored copy of <em>K<sub>n</sub></em> in …

    denver Repository record

  17. Effect of Levodopa on EEG Connectivity in Parkinson's Patients

    Torab Parhiz, SepehrThe University of Western Ontario2021

    … from graph theory, in particular the minimum spanning tree (MST) metric, and analyzed how they change after subjects take Levodopa. We observed significant changes in the lower alpha band toward a more path-like and less globally efficient network after Levodopa intake. We also observed that …

    uwo Repository record

  18. MergeArray and scalable, relaxed, concurrent, mergeable priority queues

    Coulombe, Michael JosephMassachusetts Institute of Technology2015

    … performance and scalability on a relaxed Minimum Spanning Tree benchmark compared to SprayList, a cutting-edge relaxed priority queue.

    mit Repository record

  19. Improved distributed algorithms for fundamental graph problems

    Ghaffari, MohsenMassachusetts Institute of Technology2017

    … computing maximal independent set, minimum spanning tree, minimum edge cut and minimum vertex cut, graph connectivity decompositions, network information dissemination, minimum-weight connected dominating set, and scheduling distributed protocols. We develop novel techniques, concepts, and …

    mit Repository record

  20. Prioritized Sensor Detection with Communication Constraints: A Cyber-Physical Systems Approach

    Cortez, Randy Andres

    … heterogenous sensor network. Through a minimal spanning tree approach, we show how to minimize communication links within the network which allows for larger feasible motion sets of the sensing agents that guarantee the network remains connected. We also provide an algorithm that allows for …

    unm Repository record

Page 1 of 4