Sökning: "bipartite graphs"
Visar resultat 1 - 5 av 11 avhandlingar innehållade orden bipartite graphs.
1. Simplicial Complexes of Graphs
Sammanfattning : Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a family of subgraphs of G. LÄS MER
2. 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
3. The k-assignment Polytope and the Space of Evolutionary Trees
Sammanfattning : This thesis consists of two papers.The first paper is a study of the structure of the k-assignment polytope, whose vertices are the m x n (0; 1)-matrices with exactly k 1:s and at most one 1 in each row and each column. LÄS MER
4. 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
5. 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