Tours of Graphs, Digraphs, and Sequential Machines

DOI10.1109/TC.1980.1675456MaRDI QIDQ3863919zbMATH OpenFDO

Authors Paul Cull

Publication date 1980

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1980.1675456

zbMATH Keywords

approximation algorithmsHamiltonian circuitsKnight's tourNP- complete problemssequential machinesshort tourstraveling salesman

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Applications of graph theory to circuits and networks (94C15)

This page was built for publication: Tours of Graphs, Digraphs, and Sequential Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3863919)