NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.023 seconds)

Spelling suggestions: "subject:"minimum genus"" "subject:"minimum venus""

1

Minimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation Algorithms

Hedtke, Ivo 24 August 2017 (has links)
This thesis introduces exact (ILP- and SAT/PBS-based) algorithms for the Minimum Genus Problem and the Maximum Planar Subgraph Problem. It also considers general limits of approximation algorithms for the Maximum Planar Subgraph Problem.
Minimum Genus
Maximum Planar Subgraph
ddc:510
ddc:000

Page generated in 0.0264 seconds