DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
type: Item
instance of: scholarly article
title: DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
zbMATH Open document ID: 0628.05045
DOI: 10.1016/0377-2217(88)90357-8
author: Francesco A. Brunacci
published in: European Journal of Operational Research
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05-04
zbMATH DE Number: 4021185
zbMATH Keywords: networks
zbMATH Keywords: DB2A
zbMATH Keywords: Hamiltonian circuit
zbMATH Keywords: directed graph
MaRDI profile type: Publication
full work available at URL: 0377-2217(88)90357-8
OpenAlex ID: W1971074259
cites work: A useful transform of standard input data for a classical NP-complete problem
cites work: Q4083324
cites work: An efficient collision-free protocol for prioritized access-control of cable or radio channels
cites work: On the length of optimal TSP circuits in sets of bounded diameter
cites work: The NP-completeness column: An ongoing guide
cites work: Q4142699
cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
cites work: Q3720323
description: scientific article; zbMATH DE number 4021185