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

Benot Darties, Rodolphe Giroudeau, Jean-Claude Knig, Valentin Pollet

Browse the full COCOA paper archive.