DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits

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...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1988, Vol.34 (2), p.231-236
Main Author: Brunacci, Francesco A.
Format: Article
Language:English
Subjects:
Applied sciences
Circuits
Exact sciences and technology
Flows in networks. Combinatorial problems
Graphs
Heuristic
heuristics
Networks
Operational research and scientific management
Operational research. Management science
Operations research
Scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(88)90357-8