Search for dissertations about: "Mikael Onsjö"
Found 1 swedish dissertation containing the words Mikael Onsjö.
-
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
Result pages:
1