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 32 for “"Minimum spanning tree"”.
-
Graph Theory for the Secondary School Classroom.
… units in Graph Theory, namely Vertex Coloring, Minimum Spanning Tree, Domination, and Hamiltonian Paths and Cycles, which are appropriate for high school level.</p>
-
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 …
-
Fast Parallel Algorithms and Library for Spatial Clustering and Computational Geometry
… for hierarchical 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 …
-
Effect of Levodopa on EEG Connectivity in Parkinson's Patients
… metrics 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 …
-
MergeArray and scalable, relaxed, concurrent, mergeable priority queues
… performance and scalability on a relaxed Minimum Spanning Tree benchmark compared to SprayList, a cutting-edge relaxed priority queue.
-
Improved distributed algorithms for fundamental graph problems
… include 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, …
-
On the Design, Analysis, and Implementation of Algorithms for Selected Problems in Graphs and Networks
… problems 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 …
-
Probabilistic Models and Algorithmic Analysis of Network Problems
… of some fundamental distributed algorithms, Minimum Spanning Tree (MST) in particular. We propose the Smoothed Analysis, where the key is to randomly and slightly alter the input, and show new asymptotic bounds. For the MST problem, we also design an algorithm that almost matches the lower …
-
Species limits in the Rhodocoma gigantea (Kunth) Linder complex
… bracts and perianth segments than the former. Minimum spanning tree also reveal the two groups are geographically isolated. The former group occur in the western part of the south coast along the Langeberg in Swellendam and Riversdale districts and the latter is widely distributed on the …
-
Reti complesse e analisi del segnale elettroencefalografico
… using a phase synchronization based measure, minimum spanning tree and k-core decomposition. The analysis was performed for each classical brain rhythm separately. Furthermore, we aim to provide a network approach insensitive to the effects that epoch length has on functional connectivity (FC) …
-
Spatial Accelerator Generation and Optimization for Tensor Applications
… equations, and establishes the connections by a minimum-spanning-tree-based algorithm and a breadth-first-search-based heuristic algorithm for merging different spatial dataflow designs. LEGO back end then translates the hardware in a primitive-level graph to perform lower-level optimizations, …
-
The Euclidean arborescence problem
… problem involves the creation of rooted trees embedded in the plane using the L2 distance metric. These trees are interesting in that they have a low cost yet offer responsive service from the root to any other vertex. As such, arborescences have their cost compared to that of the minimum …
-
Using simulated annealing to minimize the cost of multi-point lines in centralized computer networks : implementation for Windows 3.1
… Well-known multipoint line topologies are the tree, the bus, and the loop. When terminals are assigned a weight representing the average traffic amount exchanged with the central site and lines are constrained by the amount of traffic they can carry, the tree-topology problem is referred to as …
-
Finite element analysis of 3D electric machine problems
… is to regularize the singular matrix with tree-cotree splitting. An algorithm of finding the minimum spanning tree is given. The two solutions have different effects on the convergence of iterative solvers, which is important to the efficiency of the simulation tool. Besides, the …
-
Ensemble regression : using ensemble model output for atmospheric dynamics and prediction
… reliability verification technique called the minimum spanning tree rank histogram are presented.
-
Nymphaea odorata (Water-lily, Nymphaeaceae): Analyses of molecular and morphological studies
… clustering and principle coordinate (PCOA) and minimum spanning tree (MST) analyses produced groups similar to the clades in the ITS phylogeny. Sixteen accessions were chosen for trnL-F analysis, where a subspecies-specific molecular marker was found. In most accessions the marker confirmed the …
-
Stereo Matching Based on Edge-Aware T-MST
… method is proposed based on edge-aware truncated minimum spanning tree (T-MST). Instead of employing non-local cost aggregation on traditional MST which is only generated from color differences of neighbouring pixels, a new tree structure, "Edge-Aware T-MST", is proposed to aggregate the cost …
-
Optimizing Traveling Salesman Problem in Multi-Agent Systems with Practical Constraints
… into smaller sub-problems by splitting the minimum spanning tree (MST), solve each using a combination of TSP solvers and heuristic searches, and then aggregate the tours into a feasible solution using a Mixed-Integer Linear Program (MILP) with significantly few variables and constraints. …
-
Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model
… links and local broadcasts respectively, and the minimum spanning tree problems.<br />Under the physical interference model, we provide the first sub-linear time distributed solutions to the maximum independent set problems, and also solve the minimum spanning tree problems efficiently.<br />We …
-
Classifying complex topics using spatial-semantic document visualization: An evaluation of an interaction model to support open-ended search tasks
… We find that the local approach, based on a minimum spanning tree of similarities, produces a better classification and, as observed from strategy simulation, more efficient aspect cluster growing performance in most situations, compared to the global approach of multidimensional scaling. We …
Page 1 of 2