Editing to a Planar Graph of Given Degrees


We consider the following graph modification problem. Let the input consist of a graph G = (V,E), a weight function w : V ∪E → N, a cost function c : V ∪E → N and a degree function δ : V → N0, together with three integers kv, ke and C. The question is whether we can delete a set of vertices of total weight at most kv and a set of edges of total weight at… (More)
DOI: 10.1007/978-3-319-20297-6_10


  • Presentations referencing similar topics