Abstract:The Vertex Bisection Problem (VBP) consists in partitioning a generic graph into two equallysized subgraphs and such that the number of vertices in with at least one adjacent vertex in is minimized. This problem is NP-hard with practical applications in the telecommunication industry. In this article we propose a new constructive algorithm for VBP based on the Greedy Randomized Adaptive Search Procedure (GRASP) methodology. We call our algorithm CVBP. We compare CVBP with a previously published GRASP-based con… Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.