A heuristic approach for dividing graphs into bi-connected components with a size constraint

Raka Jovanovic, Tatsushi Nishi, Stefan Voss

In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions…