{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
