使用按秩并策略构建的并查找树的识别是np完全的

{"title":"使用按秩并策略构建的并查找树的识别是np完全的","authors":"Kitti Gelle, Szabolcs Iván","doi":"10.1007/978-3-319-60252-3_12","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete\",\"authors\":\"Kitti Gelle, Szabolcs Iván\",\"doi\":\"10.1007/978-3-319-60252-3_12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":305919,\"journal\":{\"name\":\"Workshop on Descriptional Complexity of Formal Systems\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Descriptional Complexity of Formal Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-60252-3_12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Descriptional Complexity of Formal Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-60252-3_12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}