This project is a school project for the Graph courses. The goal is to find the minimum bisection of a graph. To do so, we use three type of algorithm : The exact algorithm is a brute force algorithm.
Abstract: This paper presents a top-to-bottom element-matching strategy based on a full-permutation bisection algorithm for data converters. By bisecting the composing elements and recombining them ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback