{"title":"The isomorphism problem is polynomially solvable for certain graph languages","authors":"Manfred Schnitzler","doi":"10.1007/BFb0000119","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":303027,"journal":{"name":"Graph-Grammars and Their Application to Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graph-Grammars and Their Application to Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BFb0000119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
