当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Complexity and inapproximability results for balanced connected subgraph problem
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2021-07-16 , DOI: 10.1016/j.tcs.2021.07.010
T. Martinod 1 , V. Pollet 1 , B. Darties 1 , R. Giroudeau 1 , J.-C. König 1
Affiliation  

This work is devoted to the study of the Balanced Connected Subgraph Problem (BCS) from a complexity, inapproximability and approximation point of view. The input is a graph G=(V,E), with each vertex having been colored, “red” or “blue”; the goal is to find a maximum connected subgraph G=(V,E) from G that is color-balanced (having exactly |V|/2 red vertices and |V|/2 blue vertices). This problem is known to be NP-complete in general but polynomial in paths and trees. We propose a polynomial-time algorithm for block graph. We propose some complexity results for bounded-degree or bounded-diameter graphs, and also for bipartite graphs. We also propose inapproximability results for some graph classes, including chordal, planar, or subcubic graphs.



中文翻译:

平衡连通子图问题的复杂性和不可逼近性结果

这项工作致力于从复杂性、不可逼近性和逼近性的角度研究平衡连接子图问题(BCS)。输入是一个图形G=(,),每个顶点都被着色,“红色”或“蓝色”;目标是找到最大连通子图G=(,)来自颜色平衡的G(恰好具有||/2 红色顶点和 ||/2蓝色顶点)。这个问题已知是NP- 一般而言是完整的,但路径和树中的多项式。我们提出了一种用于块图的多项式时间算法。我们为有界度或有界直径图以及二部图提出了一些复杂性结果。我们还提出了一些图类的不可近似性结果,包括弦图、平面图或亚立方图。

更新日期:2021-09-07
down
wechat
bug