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

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DM2016★ 1 cited

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…