12 citations · 35 across the 13 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Backtracking algorithms for constructing the Hamiltonian decomposition of a 4-regular multigraph
Alexander V. Korostil, Andrei V. Nikolaev
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skel…
math.CO2020
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
Andrei Nikolaev, Anna Kozlova
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. A sufficient condition for vertex adjacency in the 1-skeleton…