An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs (Q3066156)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs |
scientific article |
Statements
An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs (English)
0 references
8 January 2011
0 references
