Please use this identifier to cite or link to this item:
http://dx.doi.org/10.25673/5261
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Grimm, Carsten | - |
dc.contributor.other | Schirra, Stefan | - |
dc.date.accessioned | 2018-09-24T17:07:24Z | - |
dc.date.available | 2018-09-24T17:07:24Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | https://opendata.uni-halle.de//handle/1981185920/11330 | - |
dc.identifier.uri | http://dx.doi.org/10.25673/5261 | - |
dc.description.statementofresponsibility | von Dipl.-Comp.-Math. Carsten Grimm | - |
dc.format.extent | 1 Online-Ressource (PDF-Datei: x, 147 Seiten, 10,14 MB) | - |
dc.language.iso | eng | - |
dc.publisher | Universitätsbibliothek | - |
dc.publisher | Otto von Guericke University Library, Magdeburg, Germany | - |
dc.title | On two problems regarding farthest distances in continuous networks | - |
dcterms.type | Hochschulschrift | - |
dc.type | PhDThesis | - |
dc.identifier.urn | urn:nbn:de:gbv:ma9:1-11093 | - |
local.publisher.universityOrInstitution | Otto-von-Guericke-Universität Magdeburg | - |
local.openaccess | true | - |
Appears in Collections: | Fakultät für Informatik |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
thesis.pdf | 10.38 MB | Adobe PDF | View/Open |