scientific article; zbMATH DE number 6850346

MaRDI QIDQ4607918zbMATH OpenFDO

Authors Joe Sawada, Aaron Williams

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175307

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• The Hamiltonian problem and \(t\)-path traceable graphs
• On the stability of approximation for Hamiltonian path problems
• SOFSEM 2005: Theory and Practice of Computer Science
• On Hamiltonian paths in distance graphs
• Absolute differences along Hamiltonian paths
• THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS
• The Hamiltonization problem from a global viewpoint
• Hamiltonian paths and cycles in hypertournaments
• Some Hamilton Paths and a Minimal Change Algorithm

Cited in

(12)

• A proof of Simmons' conjecture
• Gray codes and symmetric chains
• The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
• Solving the sigma-tau problem
• Gray codes and symmetric chains
• On a combinatorial generation problem of Knuth
• Containing all permutations
• Syntactic view of sigma-tau generation of permutations
• Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
• Constructing the first (and coolest) fixed-content universal cycle
• Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
• Constant time and space updates for the sigma-tau problem

This page was built for publication:

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