Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation (Q5140740)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7286702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation |
scientific article; zbMATH DE number 7286702 |
Statements
16 December 2020
0 references
empirical evaluation of algorithms
0 references
tree-width
0 references
Hamiltonian cycle
0 references
0 references
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation (English)
0 references
0.98735249042511
0 references
0.7936036586761475
0 references
0.7723681330680847
0 references
0.7674369812011719
0 references
