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]
@inproceedings{KundetiRH10, title = {An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs}, author = {Vamsi Kundeti and Sanguthevar Rajasekaran and Dinh Heiu}, year = {2010}, doi = {10.1007/978-3-642-17458-2_16}, url = {http://dx.doi.org/10.1007/978-3-642-17458-2_16}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/KundetiRH10}, cites = {0}, citedby = {0}, pages = {184-196}, booktitle = {Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I}, editor = {Weili Wu and Ovidiu Daescu}, volume = {6508}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-17457-5}, }