A Note on Two Problems in Connexion with Graphs
Top Cited Papers
- 12 July 2022
- book chapter
- Published by Association for Computing Machinery (ACM)
- p. 287-290
- https://doi.org/10.1145/3544585.3544600
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