Sökning: "Bipartite Matching"
Visar resultat 1 - 5 av 10 avhandlingar innehållade orden Bipartite Matching.
1. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization
Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER
2. On random cover and matching problems
Sammanfattning : This thesis consists of the following papers.I J. Larsson, The Minimum Matching in Pseudo-dimension 0 < q < 1, submittedII V. Falgas-Ravry, J. LÄS MER
3. On random satisfiability and optimization problems
Sammanfattning : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. LÄS MER
4. Quantum Graphs and Equi-transmitting Scattering Matrices
Sammanfattning : The focus of this study is scattering matrices in the framework of quantum graphs,more precisely the matrices which describe equi-transmission. They are unitary andHermitian and are independent of the energies of the associated system. LÄS MER
5. Least squares rigid body fitting of point-sets with unknown correspondences
Sammanfattning : The problem addressed here is: given points u_1,...,u_n and v_1,. LÄS MER