The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs

Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet. The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. 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 449-460, Springer, 2019. [doi]

Abstract

Abstract is missing.