网络图中寻找亚临界路径的算法

{"title":"网络图中寻找亚临界路径的算法","authors":"M. A. Аnfyorov","doi":"10.32362/2500-316x-2023-11-1-60-69","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":282368,"journal":{"name":"Russian Technological Journal","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithm for finding subcritical paths on network diagrams\",\"authors\":\"M. A. Аnfyorov\",\"doi\":\"10.32362/2500-316x-2023-11-1-60-69\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":282368,\"journal\":{\"name\":\"Russian Technological Journal\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Russian Technological Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.32362/2500-316x-2023-11-1-60-69\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Russian Technological Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32362/2500-316x-2023-11-1-60-69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}