Blar i Faculty of Mathematics and Natural Sciences på emneord "Planar graphs"
Viser treff 1-2 av 2
-
Subexponential-time parameterized algorithm for Steiner tree on planar graphs
(Peer reviewed; Journal article, 2013)The well-known bidimensionality theory provides a method for designing fast, subexponential-time parameterized algorithms for a vast number of NP-hard problems on sparse graph classes such as planar graphs, bounded genus ... -
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 ...