The balanced connected subgraph problem

The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we consider the following ( ) problem. The input is a graph , with each vertex in the set having an assigned color, “ ” or “ ”. We seek a maximum-cardinality subset of vertices that is (having exactly red vertices and blue vertices), such that the subgraph induced by the vertex set in is connected. We show that the BCS problem is NP-hard, even for bipartite graphs (with red/blue color assignment not necessarily being a proper 2-coloring). Further, we consider this problem on various graph classes, e.g., planar graphs, chordal graphs, trees, split graphs, bipartite graphs with a proper red/blue 2-coloring, and graphs with diameter 2. For each of these classes we either prove NP-hardness or design a polynomial time algorithm.