Abstract: Partitioning is a fundamental problem in diverse fields of study such as pattern recognition, parallel processing, and the design of VLSI circuits. Recently, node clustering or compaction ...

I learned an interesting algorithm during my university studies called the bisection algorithm. This algorithm is used to approximate the logarithm base 10 (log_{10}(x)) of a number by narrowing down ...

Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into distinct ...

With the rapid development of quantum computers, researchers have shown quantum advantages in physics-oriented problems. Quantum algorithms tackling computational biology problems are still lacking.

This project explores various algorithms for solving the Graph Partitioning Problem, aiming to divide the vertices of a graph into a specified number of subsets while minimizing the number of edges ...

The bisection method is the simplest of the root finding methods. When given this problem from scratch this is the method that most people come up with. We still have the question of how many times to ...