Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths

Anna Galluccio, Guido Proietti. Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. In Peter Eades, Tadao Takaoka, editors, Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings. Volume 2223 of Lecture Notes in Computer Science, pages 345-354, Springer, 2001. [doi]

Abstract

Abstract is missing.