Finding vertex-disjoint cycle cover of undirected graph using the least-squares method
We investigate the properties of the least-squares solution of the system of equations with a matrix being the incidence matrix of a given undirected connected graph and we propose an algorithm that uses this solution for finding a vertex-disjoint cycle cover (2-factor) of the graph .