Browsing Department of Informatics by Subject "parameterized algorithms"
Now showing items 1-1 of 1
-
Variants of plane diameter completion
(Peer reviewed; Journal article, 2015)The Plane Diameter Completion problem asks, given a plane graph G and a positive integer d, if it is a spanning subgraph of a plane graph H that has diameter at most d. We examine two variants of this problem where the ...