Essays about: "bipartite graph"
Showing result 1 - 5 of 15 essays containing the words bipartite graph.
-
1. Distance Consistent Labellings and the Local List Number
University essay from Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakultetenAbstract : We study the local list number of graphs introduced by Lennerstad and Eriksson. A labelling of a graph on n vertices is a bijection from vertex set to the set {1,…, n}. Given such a labelling c a vertex u is distance consistent if for all vertices v and w |c(u)-c(v)|=|c(u)-c(w)|+1 implies d(u,w)≤ d(u,v). READ MORE
-
2. The cosmological polytope of the complete bipartite graph K_{2,n}
University essay from KTH/Matematik (Avd.)Abstract : A cosmological polytope of an undirected connected graph is a lattice polytope which when the graph is interpreted as a feynman diagram can be used to calculate the contribution of that feynman diagram to the wavefunction of some cosmological models. This contribution can be calculated using the canonical form of the cosmological polytope, which can be computed by taking the sum of the canonical forms of the facets of a subdivision of the cosmological polytope. READ MORE
-
3. Imitation Learning on Branching Strategies for Branch and Bound Problems
University essay from KTH/Matematisk statistikAbstract : A new branch of machine and deep learning models has evolved in constrained optimization, specifically in mixed integer programming problems (MIP). These models draw inspiration from earlier solver methods, primarily the heuristic, branch and bound. READ MORE
-
4. Node embedding algorithms in product recommendation systems
University essay from Umeå universitet/Institutionen för datavetenskapAbstract : Product recommendation systems are used for recommending products or product- groups to users or user-groups. With the rise of big data, these systems are in- creasingly being built on machine learning algorithms that use the collection of data to train and produce recommendations. READ MORE
-
5. Upper bounds for the star chromatic index of multipartite graphs
University essay from Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakultetenAbstract : A star edge coloring is any edge coloring which is both proper and contains no cycles or path of length four which are bicolored, and the star chromatic index of a graph is the smallest number of colors for which that graph can be star edge colored. Star edge coloring is a relatively new field in graph theory, and very little is known regarding upper bounds of the star chromatic index of most graph types, one of these families being multipartite graphs. READ MORE
