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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Vamsi Kundeti' in GoogleThis author has not been identified. Look up 'Sanguthevar Rajasekaran' in GoogleThis author has not been identified. Look up 'Dinh Heiu' in Google

runs on WebDSL