Tomescu, Ioan An upper bound for the shortest Hamiltonian path in the symmetric euclidean case. (English) Zbl 0524.05042 RAIRO, Rech. Opér. 17, 297-306 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 05C38 Paths and cycles 05C45 Eulerian and Hamiltonian graphs 68W99 Algorithms in computer science Keywords:Hamiltonian path; spanning tree; complete weighted graph; diameter PDFBibTeX XMLCite \textit{I. Tomescu}, RAIRO, Rech. Opér. 17, 297--306 (1983; Zbl 0524.05042) Full Text: DOI EuDML