Finding vertex-disjoint cycle cover of undirected graph using the least-squares method

Lamač, Jan, and Vlasák, Miloslav. "Finding vertex-disjoint cycle cover of undirected graph using the least-squares method." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics CAS, 2023. 97-106. <http://eudml.org/doc/299007>.

@inProceedings{Lamač2023,
abstract = {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 $G$ and we propose an algorithm that uses this solution for finding a vertex-disjoint cycle cover (2-factor) of the graph $G$.},
author = {Lamač, Jan, Vlasák, Miloslav},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {cycle cover; 2-factor; Hamiltonian cycle; incidence matrix; least-square method},
location = {Prague},
pages = {97-106},
publisher = {Institute of Mathematics CAS},
title = {Finding vertex-disjoint cycle cover of undirected graph using the least-squares method},
url = {http://eudml.org/doc/299007},
year = {2023},
}

TY - CLSWK
AU - Lamač, Jan
AU - Vlasák, Miloslav
TI - Finding vertex-disjoint cycle cover of undirected graph using the least-squares method
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2023
CY - Prague
PB - Institute of Mathematics CAS
SP - 97
EP - 106
AB - 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 $G$ and we propose an algorithm that uses this solution for finding a vertex-disjoint cycle cover (2-factor) of the graph $G$.
KW - cycle cover; 2-factor; Hamiltonian cycle; incidence matrix; least-square method
UR - http://eudml.org/doc/299007
ER -