Sökning: "split graph"
Visar resultat 1 - 5 av 6 avhandlingar innehållade orden split graph.
1. Optimal and Hereditarily Optimal Realizations of Metric Spaces
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
2. Enumeration on words, complexes and polytopes
Sammanfattning : 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. LÄS MER
3. Topics in algorithmic, enumerative and geometric combinatorics
Sammanfattning : 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. LÄS MER
4. Graph dominators in logic synthesis and verification
Sammanfattning : 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. LÄS MER
5. Skew-symmetric matrix pencils : stratification theory and tools
Sammanfattning : 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. LÄS MER