Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem

Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto. Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. In Yingshu Li, Mihaela Cardei, Yan Huang, editors, Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings. Volume 11949 of Lecture Notes in Computer Science, pages 303-315, Springer, 2019. [doi]

Abstract

Abstract is missing.