{"title":"一种改进的同构发现算法","authors":"M. Khiyal, M. Arshad, K. Riaz","doi":"10.1109/INMIC.2003.1416758","DOIUrl":null,"url":null,"abstract":"Despite the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that we still need such an efficient algorithm for graph isomorphism which is applicable on all the general graphs. We propose an improved algorithm for discovering graph isomorphism. The emphasis is on the power of algorithm for solving practical problems and making the algorithm more efficient. The algorithm works for all kinds of undirected graphs.","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An improved algorithm to discover isomorphism\",\"authors\":\"M. Khiyal, M. Arshad, K. Riaz\",\"doi\":\"10.1109/INMIC.2003.1416758\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Despite the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that we still need such an efficient algorithm for graph isomorphism which is applicable on all the general graphs. We propose an improved algorithm for discovering graph isomorphism. The emphasis is on the power of algorithm for solving practical problems and making the algorithm more efficient. The algorithm works for all kinds of undirected graphs.\",\"PeriodicalId\":253329,\"journal\":{\"name\":\"7th International Multi Topic Conference, 2003. INMIC 2003.\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Multi Topic Conference, 2003. INMIC 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INMIC.2003.1416758\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Multi Topic Conference, 2003. INMIC 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INMIC.2003.1416758","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Despite the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that we still need such an efficient algorithm for graph isomorphism which is applicable on all the general graphs. We propose an improved algorithm for discovering graph isomorphism. The emphasis is on the power of algorithm for solving practical problems and making the algorithm more efficient. The algorithm works for all kinds of undirected graphs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
