Search for dissertations about: "split graph"

Showing result 1 - 5 of 6 swedish dissertations containing the words split graph.

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

    Author : Alice Lesser; Svante Janson; Lars-Erik Persson; Anders Johansson; Vincent Moulton; Pierre Flener; Charles Semple; Uppsala universitet; []
    Keywords : 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;

    Abstract : 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. READ MORE

  4. 2. Enumeration on words, complexes and polytopes

    Author : Ragnar Freij; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Simplicial complex; discrete Morse theory; Hansen polytope; $3^d$-conjecture; split graph; derangement; pattern containment; pattern packing; composition.; composition.;

    Abstract : This thesis presents four papers, studying enumerative problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. READ MORE

  5. 3. Topics in algorithmic, enumerative and geometric combinatorics

    Author : Ragnar Freij; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Discrete Morse theory; simplicial G-complex; centrally symmetric polytope; split graph; derangement; pattern packing; composition; finite poset; optimal stopping; secretary problem.; finite poset;

    Abstract : This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. READ MORE

  6. 4. Graph dominators in logic synthesis and verification

    Author : René Krenz; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; formal verification; logic synthesis; dominators; equivalence checking; decomposition; Computer science; Datavetenskap;

    Abstract : This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. READ MORE

  7. 5. Skew-symmetric matrix pencils : stratification theory and tools

    Author : Andrii Dmytryshyn; Bo Kågström; Umeå universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : Investigating the properties, explaining, and predicting the behaviour of a physical system described by a system (matrix) pencil often require the understanding of how canonical structure information of the system pencil may change, e.g., how eigenvalues coalesce or split apart, due to perturbations in the matrix pencil elements. READ MORE