Enhancement of an algorithm for finding a Hamiltonian cycle

DOI10.17654/MS100040573MaRDI QIDQ2963159zbMATH OpenOpenAlexFDO

Authors Mahyus Ihsan, Reza Wafdan, Hafnani, Vera Halfiani, Marwan Ramli

Publication date 10 February 2017

Published in Far East Journal of Mathematical Sciences (FJMS) (Search for Journal in Brave)

Full work available at URL http://www.pphmj.com/abstract/10011.htm

zbMATH Keywords

backtracking methodHamiltonian cyclemulti-path method

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An algorithm for finding all Hamiltonian cycles in a simple graph via hierarchical correlation
• Normal Eulerian clique-covering and hamiltonicity
• Inclusion and exclusion algorithm for the Hamiltonian path problem
• scientific article; zbMATH DE number 22818
• scientific article; zbMATH DE number 1439432

Cited in

(6)

• A successful algorithm for the undirected Hamiltonian path problem
• An extension of the multi-path algorithm for finding Hamilton cycles
• HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
• scientific article; zbMATH DE number 1821763 (Why is no real title available?)
• Methods for determining cycles of a specific length in undirected graphs with edge weights
• Normal Eulerian clique-covering and hamiltonicity

This page was built for publication: Enhancement of an algorithm for finding a Hamiltonian cycle

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