计算独立集合数目的最坏情况时间上界

{"title":"计算独立集合数目的最坏情况时间上界","authors":"G. D. I. Luna, A. López-López","doi":"10.1007/978-3-540-77294-1_9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Worst-Case Time Upper Bound for Counting the Number of Independent Sets\",\"authors\":\"G. D. I. Luna, A. López-López\",\"doi\":\"10.1007/978-3-540-77294-1_9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":415408,\"journal\":{\"name\":\"Combinatorial and Algorithmic Aspects of Networking\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorial and Algorithmic Aspects of Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-540-77294-1_9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorial and Algorithmic Aspects of Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-540-77294-1_9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}