Finding All Convex Cuts of a Plane Graph in Cubic Time

DOI10.1007/978-3-642-38233-8_21zbMath1382.68167OpenAlexW2166051294MaRDI QIDQ4924654

Roland Glantz, Henning Meyerhenke

Publication date: 7 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000030816/2350351

zbMATH Keywords

bipartite graphsplane graphspartial cubesconvex cutsDjoković relation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

On finding convex cuts in general, bipartite and plane graphs ⋮ Convex \(p\)-partitions of bipartite graphs

This page was built for publication: Finding All Convex Cuts of a Plane Graph in Cubic Time