Skip navigation
Please use this identifier to cite or link to this item: http://dx.doi.org/10.25673/5261
Title: On two problems regarding farthest distances in continuous networks
Author(s): Grimm, Carsten
Granting Institution: Otto-von-Guericke-Universität Magdeburg
Issue Date: 2017
Extent: 1 Online-Ressource (PDF-Datei: x, 147 Seiten, 10,14 MB)
Type: Hochschulschrift
Language: English
Publisher: Universitätsbibliothek
Otto von Guericke University Library, Magdeburg, Germany
URN: urn:nbn:de:gbv:ma9:1-11093
URI: https://opendata.uni-halle.de//handle/1981185920/11330
http://dx.doi.org/10.25673/5261
Open access: Open access publication
Appears in Collections:Fakultät für Informatik

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


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