We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Thesis submitted to the University of Melbourne in January 2019; degree approved on 17 April 2019; supervisors Charl Ras and Sanming Zhou.
References
[1]
Andersen, P. J. and Ras, C. J., ‘Minimum bottleneck spanning trees with degree bounds’, Networks68(4) (2016), 302–314.Google Scholar
[2]
Andersen, P. J. and Ras, C. J., ‘Algorithms for Euclidean degree bounded spanning tree problems’, Internat. J. Comput. Geom. Appl.29(2) (2019), 121–160.Google Scholar
[3]
Andersen, P. J. and Ras, C. J., ‘Degree bounded bottleneck spanning trees in three dimensions’, Preprint, 2018, arXiv:1812.11177.Google Scholar