Branches are defined as subsets of nodes in a graph, that are connected to each other only through a root node. That means if the root will be removed from a graph, each branch will be disconnected ...

In this demo, we explore the graph partitioning problem. This is an interesting problem from graph theory with a wide variety of applications (see e.g. [3]). For example, suppose that we have a group ...