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 315
- Downloads 0
Bipolar – Valued Q – Fuzzy Hx Subgroup on an Hx Group
In this paper, we define the algebraic structures of a bipolar Q – fuzzy sub HX group and some related properties are investigated. We also define a bipolar Q – fuzzy normalizer and establish the relation with a bipolar...
The Evolution of the Processing Power Needed by the Primary Cryptocurrencies and its profit.
This paper intends to follow the evolution of the processing power needed to mine cryptocurrencies. Because by this year, 2018, they evolved to being over 1500 cryptos, we shell consider reviewing the first 5: Bitcoin, E...
Complexities in a Plant-Herbivore Model
A simple host-parasite type model has been considered to study the interaction of certain plants and herbivores. The two dimensional discrete time model utilizes leaf and herbivore biomass as state variables. The paramet...
Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases
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...
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...