{"title":"Independent subsets search in a directed graph","authors":"V. Kureychik, A. Kazharov","doi":"10.1109/ICAICT.2014.7035970","DOIUrl":null,"url":null,"abstract":"When the problems of artificial intelligence, transport logistics, design automation, building intelligent CAD, mathematical economic, sociological and other are being solved it's necessary to solve problems of determining unrelated objects. Unrelated objects search based on different criteria can solve problems of science, technology and production effectively. The paper proposes a quantum algorithm to determine the independent subsets in a directed graph. It allows developing algorithms with polynomial complexity, and in some cases, linear and quadratic complexity.","PeriodicalId":103329,"journal":{"name":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICT.2014.7035970","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
When the problems of artificial intelligence, transport logistics, design automation, building intelligent CAD, mathematical economic, sociological and other are being solved it's necessary to solve problems of determining unrelated objects. Unrelated objects search based on different criteria can solve problems of science, technology and production effectively. The paper proposes a quantum algorithm to determine the independent subsets in a directed graph. It allows developing algorithms with polynomial complexity, and in some cases, linear and quadratic complexity.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
