DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits (Q1092923): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:10, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits |
scientific article |
Statements
DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits (English)
0 references
1988
0 references
The paper presents a procedure, called DB2A, for constructing a Hamiltonian circuit (HC) in a general directed graph. Application examples and a completely developed example problem are included. An appendix recalls the features of DB2, used here as a subprocedure of DB2A, and finding a Hamiltonian cycle in undirected graphs.
0 references
networks
0 references
DB2A
0 references
Hamiltonian circuit
0 references
directed graph
0 references