Persistency in the Traveling Salesman Problem on Halin graphs

DOI10.7151/DMGT.1122zbMath0982.05064OpenAlexW1999365016MaRDI QIDQ2725186

Vladimír Lacko

Publication date: 24 March 2002

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1122

zbMATH Keywords

traveling salesman problemHalin graphspersistency partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Eulerian and Hamiltonian graphs (05C45)

This page was built for publication: Persistency in the Traveling Salesman Problem on Halin graphs