图形规范的可实现性:表征和算法

{"title":"图形规范的可实现性:表征和算法","authors":"A. Bar-Noy, Keerti Choudhary, D. Peleg, Dror Rawitz","doi":"10.1007/978-3-030-01325-7_1","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Realizability of Graph Specifications: Characterizations and Algorithms\",\"authors\":\"A. Bar-Noy, Keerti Choudhary, D. Peleg, Dror Rawitz\",\"doi\":\"10.1007/978-3-030-01325-7_1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":116242,\"journal\":{\"name\":\"Colloquium on Structural Information & Communication Complexity\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Colloquium on Structural Information & Communication Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-01325-7_1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Colloquium on Structural Information & Communication Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-01325-7_1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}