Sökning: "graph embedding"

Hittade 4 avhandlingar innehållade orden graph embedding.

  1. 1. Exact and approximation algorithms for graph problems with some biological applications

    Författare :Eva-Marta Lundell; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graph algorithms; computational biology; approximation algorithms; computational complexity; evolutionary trees; maximum agreement subtree; graph embedding; shortest cycle; clique partitioning;

    Sammanfattning : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. LÄS MER

  3. 2. Optimal and Hereditarily Optimal Realizations of Metric Spaces

    Författare :Alice Lesser; Svante Janson; Lars-Erik Persson; Anders Johansson; Vincent Moulton; Pierre Flener; Charles Semple; Uppsala universitet; []
    Nyckelord :Applied mathematics; optimal realization; hereditarily optimal realization; tight span; phylogenetic network; Buneman graph; split decomposition; T-theory; finite metric space; topological graph theory; discrete geometry; Tillämpad matematik;

    Sammanfattning : This PhD thesis, consisting of an introduction, four papers, and some supplementary results, studies the problem of finding an optimal realization of a given finite metric space: a weighted graph which preserves the metric's distances and has minimal total edge weight. This problem is known to be NP-hard, and solutions are not necessarily unique. LÄS MER

  4. 3. Learning with Geometric Embeddings of Graphs

    Författare :Fredrik Johansson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Graphs are natural representations of problems and data in many fields. For example, in computational biology, interaction networks model the functional relationships between genes in living organisms; in the social sciences, graphs are used to represent friendships and business relations among people; in chemoinformatics, graphs represent atoms and molecular bonds. LÄS MER

  5. 4. Localization using Distance Geometry : Minimal Solvers and Robust Methods for Sensor Network Self-Calibration

    Författare :Martin Larsson; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; localization; TDOA; TOA; trilateration; multilateration; distance geometry; registration; sensor network self-calibration;

    Sammanfattning : In this thesis, we focus on the problem of estimating receiver and sender node positions given some form of distance measurements between them. This kind of localization problem has several applications, e.g. LÄS MER