Sökning: "minimum spanning tree"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden minimum spanning tree.

  1. 1. Progress in Hierarchical Clustering & Minimum Weight Triangulation

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Drago Krznaric; [1997]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computer technology; Systems engineering; minimum spanning tree; complete linkage; hierarchical clustering; minimum weight triangulation; greedy triangulation; Data- och systemvetenskap;

    Sammanfattning : In this thesis we study efficient computational methods for geometrical problems of practical importance and theoretical interest. The problems that we consider are primarily complete linkage clustering, minimum spanning trees, and approximating minimum weight triangulation. Below is a list of the main results proved in the thesis. LÄS MER

  2. 2. Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Magdalene Grantson Borgelt; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; control; Datalogi; numerical analysis; Convex Partition; Computer science; Triangulation; kontroll; system; numerisk analys; systems; Fixed-Parameter Algorithm; Spanning Tree;

    Sammanfattning : In this thesis I study two-dimensional geometric optimization problems for which it is difficult to find efficient, exact, deterministic algorithms. All known solutions to these problems require time that is exponential in the total size of the input. LÄS MER

  3. 3. Studies in Efficient Discrete Algorithms

    Detta är en avhandling från Lund University, Faculty of Science, Centre for Mathematical Sciences, Mathematics

    Författare :DZMITRY SLEDNEU; [2016-08]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Algorithms; Approximation algorithms; Graphs;

    Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER

  4. 4. Dynamic algorithms: new worst-case and instance-optimal bounds via new connections

    Detta är en avhandling från KTH Royal Institute of Technology

    Författare :Thatchaphol Saranurak; Danupon Nanongkai; Piotr Sankowski; [2018]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computer Science;

    Sammanfattning : This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly maintaining some information of an input data undergoing a sequence of updates. The first question asks \emph{how small the update time for handling each update can be} for each dynamic problem. LÄS MER

  5. 5. Visualisation and Generalisation of 3D City Models

    Detta är en avhandling från KTH Royal Institute of Technology

    Författare :Bo Mao; Yifang Ban; Lars Harrie; Monika Sester; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; 3D city models; Visualisation; CityGML; X3D; Generalisation; Aggregation; Typification; Quality evaluation; TECHNOLOGY Information technology; TEKNIKVETENSKAP Informationsteknik; SRA - E-vetenskap SeRC ; SRA - E-Science SeRC ;

    Sammanfattning : 3D city models have been widely used in different applications such as urban planning, traffic control, disaster management etc. Effective visualisation of 3D city models in various scales is one of the pivotal techniques to implement these applications. LÄS MER