Tours of Graphs, Digraphs, and Sequential Machines

DOI10.1109/TC.1980.1675456zbMATH Open0427.05048MaRDI QIDQ3863919

Paul Cull

Publication date: 1980

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

zbMATH Keywords

traveling salesmanHamiltonian circuitsapproximation algorithmssequential machinesNP- complete problemsKnight's tourshort tours

Mathematics Subject Classification ID

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

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)