2 papers
math.CO2023
On cone partitions for the min-cut and max-cut problems with non-negative edges
Andrei V. Nikolaev, Alexander V. Korostil
We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of ed…
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…