Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases
Journal Title: Journal of Applied Computer Science & Mathematics - Year 2016, Vol 10, Issue 21
Abstract
sed both for listing and enumerating Hamiltonian cycles contained in a planar graph. Planar cycle bases have a weighted induced graph whose weight values limited to 1. Hence making it was possible used in the Hamiltonian cycle enumeration procedures efficiently. In this paper a Hamiltonian cycle enumeration scheme is obtained through two stages. First, i cycles out of m bases cycles are determined using an appropriate constructed constraint. Secondly, to search all Hamiltonian cycles which are formed by the combination of i bases cycles obtained in the first stage efficiently. This efficiency achieved through a generation a class of objects as the representation of i cycle combinations among m bases cycles. The experiment conducted based on the proposed algorithm successfully generated and enumerated all the Hamiltonian cycles contained in a well-known example of planar graph.
Authors and Affiliations
MAHARESI Retno
Keywords
Related Articles
- EP ID EP444163
- DOI 10.4316/JACSM.201601006
- Views 369
- Downloads 0
Coefficient Inequalities for Certain Class of Analytic Functions of Complex Order
In this paper, we define the class b L of normalized analytic functions of complex order in the open unit disk, sufficient condition involving coefficient inequalities for () fz to be in the class b L of analytic fun...
Novel Kernel to Diagnose Dermatological Disorders
Development of computer aided system to diagnose dermatological disorders works as a second opinion when skin diseases have very little differences in clinical features. Support Vector Machine (SVM) is a good classifier...
Enhanced White Cane for Visually Impaired People
ccording to WHO (World Health Organization) statistics, around 285 billion people in the world have visual impairment. They find difficulty in doing their everyday tasks and detecting objects in front of them that can be...
An Attribute Involved Public Key Cryptosystem Based on P-Sylow Subgroups and Randomization
The Asymmetric Key Cryptosystem (AKC) or Public Key Encryption (PKE) is a mechanism used to encrypt the messages by using public key and decrypt the enciphered messages by using private key. Of late, the Attribute-Base...
Identification of Core Architecture Classes for Object-Oriented Software Systems
The new member of the software development team needs to understand the software prior making modifications to the unknown system. The core classes that constitute the system architecture can reveal important structural...