Essays about: "Graph-Theory."

Showing result 16 - 20 of 74 essays containing the word Graph-Theory..

  1. 16. Hierarchical Portfolio Allocation with Community Detection

    University essay from KTH/Matematik (Avd.)

    Author : Kiar Fatah; Taariq Nazar; [2022]
    Keywords : Portfolio Allocation; Hierarchical Clustering; Graph Theory; Community Detection; Modern Portfolio Theory; Portföljallokering; Hierarkisk klustring; Grafteori; Community Detection; Modern Portföljteori;

    Abstract : Traditionally, practitioners use modern portfolio theory to invest optimally. Its appeal lies in its mathematical simplicity and elegance. However, despite its beauty, the theory it is plagued with many problems, which are in combination called the Markowitz curse. READ MORE

  3. 17. Random Matrix Models

    University essay from Uppsala universitet/Teoretisk fysik

    Author : Evangelos Tsolakidis; [2022]
    Keywords : Random Variables; Matrix Models; Graph Theory; Bootstrap;

    Abstract : In this thesis, we provide a self contained introduction to the theory of random matrices and matrix models. Our analysis has a chronological order and it begins with the study of nuclear energy levels and ensemble averaging which yields the famous Wigner surmise. READ MORE

  4. 18. Linear Programming Algorithms for Multi-commodity Flow Problems

    University essay from KTH/Fysik

    Author : Isaac Rosenberg Enquist; Phillip Sjögren; [2022]
    Keywords : Multi-commodity Flow Problem; Linear Programming; Linear Optimization; Simplex; Interior-point Method; Graph Theory; Optimization Theory; Transportation Problems;

    Abstract : A multi-commodity flow problem consists of moving several commodities from their respective sources to their sinks through a network where each edge has different costs and capacity constraints. This paper explores different linear programming algorithms and their performance regarding finding an optimal solution for multi-commodity flow problems. READ MORE

  5. 19. An extremal construction for (5,24)-multigraphs

    University essay from Umeå universitet/Institutionen för matematik och matematisk statistik

    Author : William Persson Eriksson; [2022]
    Keywords : ;

    Abstract : In the mid 1900s the area of extremal graph theory took its first propersteps with the proof of Turán’s theorem. In 1963 Pál Erdős asked for an extension of this fundamental result regarding (n, s, q)-graphs; graphs on n vertices in which any s-set of vertices spans at most q edges, and multiple edges are allowed; and raised the question of determining ex(n, s, q), the maximum number of edges spanning such a graph. READ MORE

  6. 20. 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 fakulteten

    Author : Gabriel Sparrman; [2022]
    Keywords : Graph; Graph theory; Multipartite Graph; Graph Coloring; Star edge coloring; Star chromatic index;

    Abstract : 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