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 132 for “"weighted graph"”.
-
Weighted Graph Compression using Genetic Algorithms
… Consequently, it is very common for networks/graphs to be large. When graphs get too large, the computational power and time to process these networks gets expensive and inefficient. This is common in areas such as bioinformatics, epidemic contact tracing, social networks, and many others. …
-
Texture Synthesis in a Weighted Graph Using Nth-Order Voronoi Diagrams
… generate textures at variable resolutions using weighted graphs. Our method takes a number of input points that exist within a grid-like graph. Using the input points as site node the algorithm then assigns all the nodes in the graph to Voronoi regions by using geodesic rather than Euclidian …
-
Optimizing Extremal Eigenvalues of Weighted Graph Laplacians and Associated Graph Realizations
… deals with optimizing extremal eigenvalues of weighted graph Laplacian matrices. In general, the Laplacian matrix of a (weighted) graph is of particular importance in spectral graph theory and combinatorial optimization (e.g., graph partition like max-cut and graph bipartition). Especially the …
-
A Weighted-Graph Optimization Approach for Automatic Location of Forest Road Networks
In a large majority of regions where forestry activities occur, roads are the backbone of their efficient management. Automatic planning of a road network is an ongoing, challenging task. Advances have been aided by the increased availability and accuracy of digital terrain models, greater …
-
Differentiating Between a Protein and its Decoy Using Nested Graph Models and Weighted Graph Theoretical Invariants
… correct structure. To this end we use a nested graph model along with weighted invariants to minimize the errors and improve the accuracy of a predictive model to determine if we have the correct structure for a protein.
-
Algorithm for estimating the medians of a weighted graph subject to side constraints, and an application to rural hospital locations in British Columbia
… to the problem of finding the medians of a weighted graph. This concept is feasible if it can be assumed that each location sought is constrained to a subset of p nodes on an n node network. This combinatorial programming problem can be formally stated as follows: if G is a weighted graph, …
-
Partially-observed graph abstractions for authorship identification and process interference prediction
… interactions between objects can be modeled as a graph, which is a set of nodes and edges that each connect a pair of nodes. We consider the problem of predicting whether edges exist between nodes based on other pairs of nodes that we have observed. From a partially-observed graph we extract …
-
Stabilizing Weighted Graphs
An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as network bargaining games and cooperative matching games, …
-
Extraction and stabilization of quantum many-body states
“Graph” states are highly entangled quantum states that are crucial resources in measurement - based quantum computing and quantum communications. Despite the importance of photonic graph and cluster states for quantum technologies, their generation presents considerable difficulties and it is a …
-
The traveling salesman problem improving K-opt via edge cut equivalence sets
… finding a minimum cost Hamiltonian cycle in a weighted graph.
-
The traveling salesman problem improving K-opt via edge cut equivalence sets
… finding a minimum cost Hamiltonian cycle in a weighted graph.
-
The Polyhedral Geometry of Graphical Designs
A graphical design is a quadrature rule for a graph. That is, a graphical design is a subset of graph vertices for which the global averages of certain Laplacian eigenvectors are equal to weighted averages of these vectors over the design subset. This definition was inspired by classical quadrature …
-
Graphical models and point set matching
… start by regarding point pattern matching as a weighted graph matching problem. We then formulate the weighted graph matching problem as one of Bayesian inference in a probabilistic graphical model. By exploiting the existence of fundamental constraints in patterns embedded in Euclidean Spaces, …
-
Detours admitting short paths
Finding shortest paths between two vertices in a weighted graph is a well explored problem and several efficient algorithms for solving it have been reported. We propose a new variation of this problem which we call the Detour Admitting Shortest Path Problem (DASPP).We present an efficient …
-
Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree
Graphs can effectively model biomolecules, computer systems, and other applications. A weighted graph is a graph in which values or labels are assigned to the edges of the graph. However, in this thesis, we assign values to the vertices of the graph rather than the edges and we modify several …
-
Big Data Algorithms with Limited Local Resources
… on the proposed model. In particular, we study graph matching problems and LINE COVER problem in this model. For the graph matching problems, we present a randomized algorithm that finds a k-matching in a general unweighted graph of size N in time O(N+k5/2), and a randomized algorithm that …
-
Signal Structure for a Class of Nonlinear Dynamic Systems
… between manifest variables and is depicted in a weighted graph, where the weights are dynamic operators. Earlier work has defined signal structure for linear time-invariant systems through dynamical structure function. This thesis focuses on the search for the signal structure of nonlinear …
Page 1 of 7