Essays about: "bipartite"
Showing result 11 - 15 of 24 essays containing the word bipartite.
-
11. Upper bounds on the star chromatic index for bipartite graphs
University essay from Linköpings universitet/Matematik och tillämpad matematik; Linköpings universitet/Tekniska fakultetenAbstract : An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges according to certain constraints. In this thesis we consider star edge colouring, which is a variant of proper edge colouring where we additionally require the graph to have no two-coloured paths or cycles with length 4. READ MORE
-
12. Real-time Anomaly Detection on Financial Data
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : This work presents an investigation of tailoring Network Representation Learning (NRL) for an application in the Financial Industry. NRL approaches are data-driven models that learn how to encode graph structures into low-dimensional vector spaces, which can be further exploited by downstream Machine Learning applications. READ MORE
-
13. One-sided interval edge-colorings of bipartite graphs
University essay from Linköpings universitet/Matematik och tillämpad matematik; Linköpings universitet/Tekniska fakultetenAbstract : A graph is an ordered pair composed by a set of vertices and a set of edges, the latter consisting of unordered pairs of vertices. Two vertices in such a pair are each others neighbors. Two edges are adjacent if they share a common vertex. Denote the amount of edges that share a specific vertex as the degree of the vertex. READ MORE
-
14. A graph representation of event intervals for efficient clustering and classification
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Sequences of event intervals occur in several application domains, while their inherent complexity hinders scalable solutions to tasks such as clustering and classification. In this thesis, we propose a novel spectral embedding representation of event interval sequences that relies on bipartite graphs. READ MORE
-
15. A comparison of a Lazy PageRank and variants for common graph structures
University essay from Mälardalens högskola/Akademin för utbildning, kultur och kommunikationAbstract : The thesis first reviews the mathematics behind the Google’s PageRank, which is the state-of-the-art webpage ranking algorithm. The main focus of the thesis is on exploring a lazy PageRank and variants, related to a random walk, and by realizing that, they can be computed using the very same algorithm, find lazy PageRank and variants' expressions for some common graph structures, for example, a line-graph, a complete-graph, a complete-bipartite graph including a star graph, and try to get some understanding of the behavior of the PageRank, when a network evolves, for example either by a contraction or an expansion of graphs’ nodes or links. READ MORE
