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

Kalman Filters for Estimating the potential GDP

The estimation of the potential GDP has a twofold importance: on one hand its accurate estimation allows the correct dimensioning of the macroeconomic policies and on the other hand, the study of potential GDP is a resea...

Secure and Efficient Diffusion Layers for Block Ciphers

Abstract–Modern block ciphers are designed to meet confusion and diffusion criteria. Substitution and permutation layers are used in the round function for this purpose. In this paper, we present a number of choices for...

Application Of Mathematical Methods For Condition Monitoring Of Oil And Gas Facilities

irections for numerical realization of two-dimensional models in different frames account for environmental heterogeneity of matter distribution have been presented. The schemes allow to measure concentration of substanc...

Removal of Baseline Wander Noise from Electrocardiogram (ECG) using Fifth-order Spline Interpolation

Abstract–Baseline wandering can mask some important features of the Electrocardiogram (ECG) signal hence it is desirable to remove this noise for proper analysis and display of the ECG signal. This paper presents the imp...

Framework for Urdu News Headlines Classification

Automatic text classification has great significance in the field of text mining and plays a pivotal role in areas such as spam filtering, news classification, noise reduction etc. It is evident from the literature that...

Download PDF file
  • EP ID EP444163
  • DOI 10.4316/JACSM.201601006
  • Views 111
  • Downloads 0

How To Cite

MAHARESI Retno (2016). Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases. Journal of Applied Computer Science & Mathematics, 10(21), 36-41. https://europub.co.uk/articles/-A-444163