Graph traversals, genes and matroids: An efficient case of the travelling salesman problem (Q1281769)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph traversals, genes and matroids: An efficient case of the travelling salesman problem |
scientific article; zbMATH DE number 1268160
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph traversals, genes and matroids: An efficient case of the travelling salesman problem |
scientific article; zbMATH DE number 1268160 |
Statements
Graph traversals, genes and matroids: An efficient case of the travelling salesman problem (English)
0 references
22 March 1999
0 references
graph traversal problems
0 references
0.8569578
0 references
0.85497886
0 references
0.8527601
0 references
0.84290344
0 references
