The Star Degree Centrality Problem: A Decomposition Approach
We consider the problem of identifying the induced star with the largest cardinality open neighborhood in a graph. This problem, also known as the star degree centrality (SDC) problem, has been shown to be š¯’©š¯’«-complete. In this work, we first propose a new integer programming (IP) formulation, which has a fewer number of constraints and … Read more