Balanced Connected Subgraph Problem in Geometric Intersection Graphs

09/09/2019
by   Sujoy Bhore, et al.
0

We study the Balanced Connected Subgraph(shortly, BCS) problem on geometric intersection graphs such as interval, circular-arc, permutation, unit-disk, outer-string graphs, etc. Given a vertex-colored graph G=(V,E), where each vertex in V is colored with either “red” or “blue”, the BCS problem seeks a maximum cardinality induced connected subgraph H of G such that H is color-balanced, i.e., H contains an equal number of red and blue vertices. We study the computational complexity landscape of the BCS problem while considering geometric intersection graphs. On one hand, we prove that the BCS problem is NP-hard on the unit disk, outer-string, complete grid, and unit square graphs. On the other hand, we design polynomial-time algorithms for the BCS problem on interval, circular-arc and permutation graphs. In particular, we give algorithm for the Steiner Tree problem on both the interval graphs and circular arc graphs, that is used as a subroutine for solving BCS problem on same graph classes. Finally, we present a FPT algorithm for the BCS problem on general graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2018

The Balanced Connected Subgraph Problem

The problem of computing induced subgraphs that satisfy some specified r...
research
10/16/2019

Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem

The Balanced Connected Subgraph problem (BCS) was recently introduced by...
research
09/09/2019

Maximum Bipartite Subgraph of Geometric Intersection Graphs

We study the Maximum Bipartite Subgraph(MBS) problem, which is defined a...
research
08/27/2019

Interval-Permutation Segment Graphs

In this work, we introduce the interval permutation segment (IP-SEG) mod...
research
07/13/2023

Establishing Herd Immunity is Hard Even in Simple Geometric Networks

We study the following model of disease spread in a social network. At f...
research
11/02/2018

A simplified disproof of Beck's three permutations conjecture and an application to root-mean-squared discrepancy

A k-permutation family on n vertices is a set system consisting of the i...
research
11/09/2018

A note on simultaneous representation problem for interval and circular-arc graphs

In this short note, we show two NP-completeness results regarding the si...

Please sign up or login with your details

Forgot password? Click here to reset