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 |
Type: | PhDThesis |
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: | ![]() |
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 |