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]

Authors

Roland Glantz

This author has not been identified. Look up 'Roland Glantz' in Google

Henning Meyerhenke

This author has not been identified. Look up 'Henning Meyerhenke' in Google