{"title":"On one algorithm of covering a graph by heterogeneous chains","authors":"N.A. Likholat","doi":"10.15421/247731","DOIUrl":null,"url":null,"abstract":"In the paper, we propose the algorithm of covering a graph by chains of types that satisfy bounds for length and total weight of a chain.","PeriodicalId":52827,"journal":{"name":"Researches in Mathematics","volume":"75 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Researches in Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15421/247731","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0
Abstract
In the paper, we propose the algorithm of covering a graph by chains of types that satisfy bounds for length and total weight of a chain.