Cellular processing algorithm for the vertex bisection problem: Detailed analysis and new component design

Abstract The vertex bisection problem splits a graph G = ( V , E ) into two sets, L ⊆ V , | L | = ⌊ | V | / 2 ⌋ and R = V ∖ L , such that it minimizes the number of vertices in L connected to R . This problem is a combinatorial NP-hard problem with relevant applications in network comm...More