Please use this identifier to cite or link to this item:
http://dx.doi.org/10.25673/5041
Title: | Zur Komplexität von Reduzierbarkeitsproblemen über H-Comparabilitygraphen |
Author(s): | Andresen, Michael |
Referee(s): | Bräsel, Heidemarie |
Granting Institution: | Otto-von-Guericke-Universität Magdeburg |
Issue Date: | 2009 |
Extent: | Online-Ressource (PDF-Datei: 194 S., 2578 KB) |
Type: | Hochschulschrift |
Type: | PhDThesis |
Language: | German |
Publisher: | Universitätsbibliothek Otto von Guericke University Library, Magdeburg, Germany |
URN: | urn:nbn:de:101:1-201012104588 |
Subjects: | Graphentheorie Reduzierbarkeit |
URI: | https://opendata.uni-halle.de//handle/1981185920/11132 http://dx.doi.org/10.25673/5041 |
Open Access: | Open access publication |
Appears in Collections: | Fakultät für Mathematik |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Dissertation_(Michael_Andresen).PDF | 2.58 MB | Adobe PDF | View/Open |