{"title":"深度优先搜索的随机NC算法","authors":"A. Aggarwal, Richard J. Anderson","doi":"10.1145/28395.28430","DOIUrl":null,"url":null,"abstract":"In this paper we present a fast parallel algorithm for constructing a depth first search tree for an undirected graph. The algorithm is an RNC algorithm, meaning that it is a probabilistic algorithm that runs in polylog time using a polynomial number of processors on a P-RAM. The run time of the algorithm is &Ogr;(TMM(n)log3n), and the number of processors used is PMM(n) where TMM(n) and PMM(n) are the time and number of processors needed to find a minimum weight perfect matching on an n vertex graph with maximum edge weight n.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"92","resultStr":"{\"title\":\"A random NC algorithm for depth first search\",\"authors\":\"A. Aggarwal, Richard J. Anderson\",\"doi\":\"10.1145/28395.28430\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a fast parallel algorithm for constructing a depth first search tree for an undirected graph. The algorithm is an RNC algorithm, meaning that it is a probabilistic algorithm that runs in polylog time using a polynomial number of processors on a P-RAM. The run time of the algorithm is &Ogr;(TMM(n)log3n), and the number of processors used is PMM(n) where TMM(n) and PMM(n) are the time and number of processors needed to find a minimum weight perfect matching on an n vertex graph with maximum edge weight n.\",\"PeriodicalId\":161795,\"journal\":{\"name\":\"Proceedings of the nineteenth annual ACM symposium on Theory of computing\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"92\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the nineteenth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/28395.28430\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/28395.28430","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we present a fast parallel algorithm for constructing a depth first search tree for an undirected graph. The algorithm is an RNC algorithm, meaning that it is a probabilistic algorithm that runs in polylog time using a polynomial number of processors on a P-RAM. The run time of the algorithm is &Ogr;(TMM(n)log3n), and the number of processors used is PMM(n) where TMM(n) and PMM(n) are the time and number of processors needed to find a minimum weight perfect matching on an n vertex graph with maximum edge weight n.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
