Search for dissertations about: "graph bisection"

Found 2 swedish dissertations containing the words graph bisection.

  1. 1. Graph Partitioning and Planted Partitions

    University dissertation from Chalmers University of Technology

    Author : Mikael Onsjö; Chalmers tekniska högskola.; Chalmers University of Technology.; [2008]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computer science; graphs; graph partitioning; graph bisection; clustering; planted partition; algorithms;

    Abstract : Graph partitioning is the problem of splitting a graph into two or more partitions of fixed sizes while minimizing the number of edges that are “cut”. This is an important problem with a wide range of applications in fields such as VLSI design, parallel processing, bioinformatics, data mining etc. READ MORE

  2. 2. High Performance Adaptive Finite Element Methods With Applications in Aerodynamics

    University dissertation from Stockholm : KTH Royal Institute of Technology

    Author : Niclas Jansson; KTH.; [2013]

    Abstract : The massive computational cost for resolving all scales in a turbulent flow makes a direct numerical simulation of the underlying Navier-Stokes equations impossible in most engineering applications. Recent advances in adaptive finite element methods offer a new powerful tool in Computational Fluid Dynamics (CFD). READ MORE