Login / Signup

Complexity and inapproximability results for balanced connected subgraph problem.

Timothée MartinodValentin PolletBenoît DartiesRodolphe GiroudeauJean-Claude König
Published in: Theor. Comput. Sci. (2021)
Keyphrases