Timothée Martinod, Valentin Pollet, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König. Complexity and inapproximability results for balanced connected subgraph problem.
Theoretical Computer Science, Elsevier, 2021, 886, pp.69-83.
⟨10.1016/j.tcs.2021.07.010⟩.
⟨lirmm-03475313⟩