| Title:
|
Finding vertex-disjoint cycle cover of undirected graph using the least-squares method (English) |
| Author:
|
Lamač, Jan |
| Author:
|
Vlasák, Miloslav |
| Language:
|
English |
| Journal:
|
Programs and Algorithms of Numerical Mathematics |
| Volume:
|
Proceedings of Seminar. Jablonec nad Nisou, June 19-24, 2022 |
| Issue:
|
2022 |
| Year:
|
|
| Pages:
|
97-106 |
| . |
| Category:
|
math |
| . |
| 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$. (English) |
| Keyword:
|
cycle cover |
| Keyword:
|
2-factor |
| Keyword:
|
Hamiltonian cycle |
| Keyword:
|
incidence matrix |
| Keyword:
|
least-square method |
| MSC:
|
05C38 |
| MSC:
|
05C50 |
| MSC:
|
93E24 |
| DOI:
|
10.21136/panm.2022.10 |
| . |
| Date available:
|
2023-04-13T06:24:19Z |
| Last updated:
|
2025-06-02 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/703192 |
| . |
