{"title":"更快的子树同构","authors":"R. Shamir, Dekel Tsur","doi":"10.1109/ISTCS.1997.595164","DOIUrl":null,"url":null,"abstract":"We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O(~k/sup 1.8//log k\\ n) time algorithm for this problem, where k and n are the number of vertices in H and G respectively. This improves over the O(k/sup 1.5/n) algorithms of Chung (1987) and Matula (1978). We also give a randomized (Las Vegas) O(min(k/sup 1.45/n, kn/sup 1.43/))-time algorithm for the decision problem.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"146","resultStr":"{\"title\":\"Faster subtree isomorphism\",\"authors\":\"R. Shamir, Dekel Tsur\",\"doi\":\"10.1109/ISTCS.1997.595164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O(~k/sup 1.8//log k\\\\ n) time algorithm for this problem, where k and n are the number of vertices in H and G respectively. This improves over the O(k/sup 1.5/n) algorithms of Chung (1987) and Matula (1978). We also give a randomized (Las Vegas) O(min(k/sup 1.45/n, kn/sup 1.43/))-time algorithm for the decision problem.\",\"PeriodicalId\":367160,\"journal\":{\"name\":\"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"146\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTCS.1997.595164\",\"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 Fifth Israeli Symposium on Theory of Computing and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTCS.1997.595164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O(~k/sup 1.8//log k\ n) time algorithm for this problem, where k and n are the number of vertices in H and G respectively. This improves over the O(k/sup 1.5/n) algorithms of Chung (1987) and Matula (1978). We also give a randomized (Las Vegas) O(min(k/sup 1.45/n, kn/sup 1.43/))-time algorithm for the decision problem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
