About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

Lamač, Jan ; Vlasák, Miloslav
Finding vertex-disjoint cycle cover of undirected graph using the least-squares method. (English). In: Chleboun, J., Kůs, P., Papež, J., Rozložník, M., Segeth, K. and Šístek, J. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Jablonec nad Nisou, June 19-24, 2022. Institute of Mathematics CAS, Prague, 2023. pp. 97-106
MSC: 05C38, 05C50, 93E24 | DOI: 10.21136/panm.2022.10
Keywords:
cycle cover; 2-factor; Hamiltonian cycle; incidence matrix; least-square method
Summary:
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$.
Partner of
EuDML logo