Swanepoel, Konrad (2000) On the existence of shortest directed networks. Journal of combinatorial mathematics and combinatorial computing, 33 . pp. 97-102. ISSN 0835-3026
A digraph connecting a set A to a set B such that there is an a-b path for each a in A and b in B is a directed network. The author proves that for a finitely compact metric space in which geodesics exist, any two finite sets A and B are connected by a shortest directed network. A bound on the Steiner points is also established.
|Additional Information:||© 2000 Charles Babbage Research Centre|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Mathematics|
Actions (login required)
|Record administration - authorised staff only|