DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits (Q1092923): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A useful transform of standard input data for a classical NP-complete problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient collision-free protocol for prioritized access-control of cable or radio channels / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the length of optimal TSP circuits in sets of bounded diameter / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-completeness column: An ongoing guide / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3720323 / rank | |||
Normal rank | |||
Latest revision as of 12:47, 18 June 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
0 references
0 references
