Department of Computer Science & Engineering Scholar, Gauhati University Jalukbari, Guwahati-781014, Assam, India
Online published on 4 December, 2014.
In this paper, a heuristic algorithm has been developed for complete graph having vertices greater than equal to 4 using the concept of perfect matching.
Hamiltonian Cycle, Heuristic, Complete graph, Perfect Matching
