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 44 for “"Spanning Trees"”.
-
Faster generation of random spanning trees
… for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1+6) of uniform in expected time ... . This improves the sparse graph case of the best previously known worst-case bound of O(min{mn, n2. …
-
Approximating Average Bounded-Angle Minimum Spanning Trees
… 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 …
-
Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications
… exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the minimal distinct distance trees and modular Leech trees have been considered in recent years. In this thesis, such Leech-type …
-
Analysis of Algorithms for Finding All Spanning Trees of a Graph
Made available in DSpace on 2014-12-10T20:13:26Z (GMT). No. of bitstreams: 1 7114697.pdf: 2464146 bytes, checksum: 68120445ae87a9d8e5b5bd8ef7521b26 (MD5) Previous issue date: 1970
-
A q-analogue of spanning trees : nilpotent transformations over finite fields
… between nilpotent transformations and spanning trees. For example, nilpotent endomorphisms on an n-dimensional vector space over Fq is a q-analogue of rooted spanning trees of the complete graph Kn. This relationship is based on two similar bijective proofs to calculate the number of …
-
Edge disjoint spanning trees and failure recovery in data communication networks
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1983.
-
Improved genetic algorithm for distribution system performance analysis by taking advantage of essential spanning trees
… In this thesis, the method called essential spanning tree is expanded to improve the computational efficiency of the algorithm. This is accomplished by replacing the so-called M matrix and its associated process with the random selection of b essential branches, where b is the number of …
-
Algoritmos de colonias de hormigas para optimización combinatoria con múltiples objetivos: aplicaciones a los problemas de minimum spanning trees
… (ACO) para el Multiple Objective Minimum Spanning Trees y los problemas combinatorios relacionados es la principal preocupación de esta investigación. Es la clasificación comúnmente validada de la complejidad de los problemas, se clasifica el problema de las Multiple Objectiva Minimum …
-
A decomposition procedure for finding the minimal Hamiltonian chain of a sparse graph
… Hamiltonian chains are derived by using minimal spanning trees.
-
Fast spectral primitives for directed graphs
… dominant matrix and for sampling random spanning trees from a graph. --
-
Applications of Geometric and Spectral Methods in Graph Theory
… 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 …
-
Dynamical systems on networks
… bounds can be formulated in terms of sums over spanning trees which we further use to deduce that the volume is intimately related to the number of spanning trees for dense networks. We also characterize the structure of fixed points of the Kuramoto model by showing that every fixed point …
-
Optimal control for wireless networks
… capacity by balancing traffic over a set of spanning trees, which are difficult to maintain in a large and time-varying network. We propose a fundamentally new broadcast policy, which is decentralized, utilizes local information only, does not require the use of global topological structures, …
-
Peer-to-Peer Group Communication for City-Scale Mesh Networks
… I compose our unicast primitive into multicast trees using three different topologies, and surprisingly find that Steiner trees perform worse than minimum spanning trees on average.
-
Extremal problems on cycles, packing, and decomposition of graphs
… is at least its independence number has a spanning cycle. In 1976, Fouquet and Jolivet conjectured an extension: If G is an n-vertex k-connected graph with independence number a, and a ≥ k, then G has a cycle with length at least k(n+a−k)/a . In Chapter 2 we prove this conjecture. …
-
Stochastically Stable States for Perturbed Repeated Play of Coordination Games
… are identified by finding minimum-weight spanning trees of a weighted directed graph on the set of recurrent classes for the unperturbed process. When the sample size equals the memory length m, cycles may be present in the unperturbed process. Necessary and sufficient conditions for the …
-
Computational, statistical and graph-theoretical methods for disease mapping and cluster detection
… clusters of any shape based on Euclidean minimum spanning trees. For mapping applications, we present an optimal strategy for mapping patient locations that preserves both privacy and spatial patterns within the data. For real-time disease surveillance, in which the goal is early detection of …
-
Extremal problems in pseudo-random graphs and asymptotic enumeration
… with respect to the property of containing large trees with bounded maximum degree. Our first main theorem, joint work with Jozsef Balogh, Bela Csaba, and Martin Pei, gives a sufficient condition on p to imply that with probability tending to 1 as n tends to infinity, G(n,p) contains all almost …
-
Opportunistic clock synchronization for ad hoc networks
… use strict communication structures such as spanning trees. In such protocols, a node corrects its logical clock when it receives a new time-stamped message from its parent. In this thesis, we present a new clock synchronization protocol that exploits the broadcast medium in wireless …
-
Sparsity and computation reduction for high-rate visual-inertial odometry
… is near optimal in a weighted number of spanning trees sense. Recent results in the SLAM community suggest that maximizing this connectivity metric corresponds to good information-theoretic performance. Simulation results confirm that decimation-style strategies perform as well or better …
Page 1 of 3