Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem

Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling. Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. In Daniel S. Hirschberg, Eugene W. Myers, editors, Combinatorial Pattern Matching, 7th Annual Symposium, CPM 96, Laguna Beach, California, USA, June 10-12, 1996, Proceedings. Volume 1075 of Lecture Notes in Computer Science, pages 304-319, Springer, 1996.

Abstract

Abstract is missing.