Skip navigation
Please use this identifier to cite or link to this item: http://dx.doi.org/10.25673/5261
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGrimm, Carsten-
dc.contributor.otherSchirra, Stefan-
dc.date.accessioned2018-09-24T17:07:24Z-
dc.date.available2018-09-24T17:07:24Z-
dc.date.issued2017-
dc.identifier.urihttps://opendata.uni-halle.de//handle/1981185920/11330-
dc.identifier.urihttp://dx.doi.org/10.25673/5261-
dc.description.statementofresponsibilityvon Dipl.-Comp.-Math. Carsten Grimm-
dc.format.extent1 Online-Ressource (PDF-Datei: x, 147 Seiten, 10,14 MB)-
dc.language.isoeng-
dc.publisherUniversitätsbibliothek-
dc.publisherOtto von Guericke University Library, Magdeburg, Germany-
dc.titleOn two problems regarding farthest distances in continuous networks-
dcterms.typeHochschulschrift-
dc.typeDoctoral Thesis-
dc.identifier.urnurn:nbn:de:gbv:ma9:1-11093-
local.publisher.universityOrInstitutionOtto-von-Guericke-Universität Magdeburg-
local.openaccesstrue-
Appears in Collections:Fakultät für Informatik

Files in This Item:
File Description SizeFormat 
thesis.pdf10.38 MBAdobe PDFThumbnail
View/Open
Show simple item record BibTeX EndNote


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.