research
∙
08/21/2017
Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter
Minimum k-Section denotes the NP-hard problem to partition the vertex se...
research
∙
08/21/2017