Talks and Poster Presentations (with Proceedings-Entry):

S. Bhore, S. Jana, S. Pandit, S. Roy:
"Balanced Connected Subgraph Problem in Geometric Intersection Graphs";
Talk: Annual International Conference on Combinatiorial Optimization and Applications (COCOA), Xiamen, Fujian, China; 2019-12-13 - 2019-12-15; in: "COCOA 2019: Combinatorial Optimization and Applications", LNCS, 11949 (2019), ISBN: 978-3-030-36411-3; 56 - 68.

English abstract:
We study the Open image in new window (shortly, Open image in new window ) problem on geometric intersection graphs such as interval, circular-arc, permutation, unit-disk, outer-string graphs, etc. Given a Open image in new window graph G=(V,E), where each vertex in V is colored with either " Open image in new window " or " Open image in new window ", the BCS problem seeks a maximum cardinality induced connected subgraph H of G such that H is Open image in new window , 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 algorithms for the Open image in new window problem on both interval and circular-arc graphs, and those algorithms are used as subroutines for solving the BCS problem on the same classes of graphs. Finally, we present a FPT algorithm for the BCS problem on general graphs.

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Electronic version of the publication:

Created from the Publication Database of the Vienna University of Technology.