Search for dissertations about: "planted partition"
Found 1 swedish dissertation containing the words planted partition.
University dissertation from Chalmers University of Technology
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