{"title":"用最小二乘法求无向图的顶点不相交环盖","authors":"J. Lamač, M. Vlasák","doi":"10.21136/panm.2022.10","DOIUrl":null,"url":null,"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$.","PeriodicalId":197168,"journal":{"name":"Programs and Algorithms of Numerical Mathematics 21","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Finding vertex-disjoint cycle cover of undirected graph using the least-squares method\",\"authors\":\"J. Lamač, M. Vlasák\",\"doi\":\"10.21136/panm.2022.10\",\"DOIUrl\":null,\"url\":null,\"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$.\",\"PeriodicalId\":197168,\"journal\":{\"name\":\"Programs and Algorithms of Numerical Mathematics 21\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Programs and Algorithms of Numerical Mathematics 21\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21136/panm.2022.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Programs and Algorithms of Numerical Mathematics 21","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21136/panm.2022.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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 $G$ and we propose an algorithm that uses this solution for finding a vertex-disjoint cycle cover (2-factor) of the graph $G$.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
