6 citations · 7 across the 12 of their papers we have counts for
5 papers · 1 filter
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem
Pouya Baniasadi, Vladimir Ejov, Jerzy A Filar +2
We present a polynomial complexity, deterministic, heuristic for solving the Hamiltonian Cycle Problem (HCP) in an undirected graph of order . Although finding a Hamiltonian cyc…
A Linear-size Conversion of HCP to 3HCP
Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
We provide an algorithm that converts any instance of the Hamiltonian cycle problem (HCP) into a cubic instance of HCP (3HCP), and prove that the input size of the new instance is…
Genetic Theory for Cubic Graphs
Pouya Baniasadi, Vladimir Ejov, Jerzy Filar +1
We propose a partitioning of the set of unlabelled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants is much l…
An effective algorithm for the enumeration of edge colorings and Hamiltonian cycles in cubic graphs
V. Ejov, N. Pugacheva, S. Rossomakhine +1
We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that sepa…
Clustering of spectra and fractals of regular graphs
V. Ejov, J. A. Filar, S. K. Lucas +1
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike…