A note on two problems in connexion with graphs
- 1 December 1959
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 1 (1) , 269-271
- https://doi.org/10.1007/bf01386390
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Formal Procedures for Connecting Terminals with a Minimum Total Wire LengthJournal of the ACM, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956