# Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem

@article{Kobayashi2019AlgorithmsAH, title={Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem}, author={Yasuaki Kobayashi and Kensuke Kojima and Norihide Matsubara and Taiga Sone and Akihiro Yamamoto}, journal={ArXiv}, year={2019}, volume={abs/1910.07305} }

The Balanced Connected Subgraph problem (BCS) was recently introduced by Bhore et al. (CALDAM 2019). In this problem, we are given a graph G whose vertices are colored by red or blue. The goal is to find a maximum connected subgraph of G having the same number of blue vertices and red vertices. They showed that this problem is NP-hard even on planar graphs, bipartite graphs, and chordal graphs. They also gave some positive results: BCS can be solved in \(O(n^3)\) time for trees and \(O(n + m… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 18 REFERENCES

## The Balanced Connected Subgraph Problem

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## The steiner problem in graphs

VIEW 2 EXCERPTS

## Parameterized Algorithms

VIEW 1 EXCERPT

## Matroids, Matchings, and Fairness

VIEW 1 EXCERPT