In the MNWCS problem, we are given a connected graph G ( V , E ) , with an integer weight associated with each vertex (node) in V , and an integer bound B ; the objective is to decide whether there exists a subset V ′ ⊆ V such that the subgraph induced by V ′ is connected and the total weight of the vertices in V ′ is ...
Sep 24, 2018 · In this paper, we consider the following Balanced Connected Subgraph (shortly, BCS) problem. The input is a graph G=(V,E), with each vertex in ...
The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well ...
Oct 15, 2022 · In this paper, we consider the balanced connected subgraph problem on various graph families and present several hardness and algorithmic ...
Balanced Connected Subgraph (BCS) Problem. Input: A graph G = (V,E), with node set V = VR ∪ VB partitioned into red nodes (VR) and blue nodes (VB). Goal: Find ...
Sep 24, 2018 · The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and ...
The Balanced Connected Subgraph problem (BCS) was introduced by Bhore et al. In the BCS problem we are given a vertex-colored graph G = (V, E) where each ...
Jan 19, 2019 · Given a graph G = (V, E) of diameter 2, where the vertices in G are colored either red or blue. If G has b blue and r red vertices then, in O(n^ ...
It is shown that the BCS problem is NP-hard, even for bipartite graphs G (with red/blue color assignment not necessarily being a proper 2-coloring), ...
Oct 15, 2022 · The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and ...