Plane and simple: using planar subgraphs for efficient algorithms
A Schmid - 2019 - publikationen.sulb.uni-saarland.de
In this thesis, we showcase how planar subgraphs with special structural properties can be
used to fi nd efficient algorithms for two NP-hard problems in combinatorial optimization. In …
used to fi nd efficient algorithms for two NP-hard problems in combinatorial optimization. In …