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

Data mining techniques for e-learning

Data Mining (DM), sometimes called Knowledge Discovery in Databases (KDD), is a powerful new technology with great potential to help companies focus on the most important information in the data they have collected via t...

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...

Mining Social Media and DBpedia Data Using Gephi and R

The big data is playing a big role in the field of machine learning and data mining. To extract meaningful and interesting information from big data mining is a challenge. The size of the data at social media and Wikiped...

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...

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 334
  • 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