Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph (Q4749863)
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 3805588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph |
scientific article; zbMATH DE number 3805588 |
Statements
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph (English)
0 references
1983
0 references
Hamiltonian circuit
0 references
depth-first search
0 references
randomly generated digraphs
0 references
