Sökning: "bipartite graph"

Visar resultat 1 - 5 av 15 uppsatser innehållade orden bipartite graph.

  1. 1. Distance Consistent Labellings and the Local List Number

    Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Anders Henricsson; [2023]
    Nyckelord :distance-consistence; graph labelling; graph distance; avstånds-konsistens; grafmärkning; grafavstånd;

    Sammanfattning : 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). LÄS MER

  3. 2. The cosmological polytope of the complete bipartite graph K_{2,n}

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Erik Landin; [2023]
    Nyckelord :Polytopes; Cosmological polytopes; Gröbner bases; Graphs; Polytop; Kosmologiska polytop; Gröbner baser; Grafer;

    Sammanfattning : 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. LÄS MER

  4. 3. Imitation Learning on Branching Strategies for Branch and Bound Problems

    Master-uppsats, KTH/Matematisk statistik

    Författare :Magnus Axén; [2023]
    Nyckelord :Graph Networks; Convolutions; MIP; Branch and Bound; Facility Location Problem; MDP; Imitation Learning; Graf nätverk; Faltning; Blandade heltaltsproblem; Branch and Bound; Facility Location Problem; Markov; Imitationsinlärning;

    Sammanfattning : 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. LÄS MER

  5. 4. Node embedding algorithms in  product recommendation systems

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Klas Holmberg; [2022]
    Nyckelord :;

    Sammanfattning : 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. LÄS MER

  7. 5. Upper bounds for the star chromatic index of multipartite graphs

    Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Gabriel Sparrman; [2022]
    Nyckelord :Graph; Graph theory; Multipartite Graph; Graph Coloring; Star edge coloring; Star chromatic index;

    Sammanfattning : 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. LÄS MER