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 4 of 4 for “"Weighted matching"”.
-
Algorithms for Vertex-Weighted Matching in Graphs
<p>A matching M in a graph is a subset of edges such that no two edges in M are incident on the same vertex. Matching is a fundamental combinatorial problem that has applications in many contexts: high-performance computing, bioinformatics, network switch design, web technologies, etc. Examples in …
-
The Use of Formal Grammars in Automatic Speech Recognition
… of a string involves the use of the ‘weighted matching network' technique in the FSG approach and the computation of the minimisation matrix M for the CFG approach. Both the FSG and CFG models offer comparable recognition performances whilst the use of the CFG approach results in an …
-
Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm
… In this thesis, we consider the online bipartite matching problem where each server can serve exactly one request. In the online minimum metric bipartite matching problem, we are provided with a set of server locations in a metric space. Requests arrive one at a time that have to be immediately …
-
Constant time algorithms in sparse graph model
… for problems such as Vertex Cover, Maximum Matching, Maximum Weighted Matching, Maximum Independent Set and Set Cover. Some of our techniques can also be applied to design constant-time testers for minor-closed properties. In Chapter 1, we show how to construct a simple oracle that provides …