On finding convex cuts in general, bipartite and plane graphs

Roland Glantz, Henning Meyerhenke. On finding convex cuts in general, bipartite and plane graphs. Theoretical Computer Science, 695:54-73, 2017. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: