Search for dissertations about: "graph bisection"
Found 2 swedish dissertations containing the words graph bisection.
-
1. Graph Partitioning and Planted Partitions
Abstract : Graph partitioning is the problem of splitting a graph into two or morepartitions 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 suchas VLSI design, parallel processing, bioinformatics, data mining etc. READ MORE
-
2. High Performance Adaptive Finite Element Methods : With Applications in Aerodynamics
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