An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs

Vamsi Kundeti, Sanguthevar Rajasekaran, Dinh Heiu. An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs. In Weili Wu, Ovidiu Daescu, editors, Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I. Volume 6508 of Lecture Notes in Computer Science, pages 184-196, Springer, 2010. [doi]

Abstract

Abstract is missing.