Login / Signup

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

Benoît DartiesRodolphe GiroudeauJean-Claude KönigValentin Pollet
Published in: COCOA (2019)
Keyphrases