E. Tomita, K. Yoshida, T. Hatta, A. Nagao, Hiro Ito, Mitsuo Wakatsuki
{"title":"A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique","authors":"E. Tomita, K. Yoshida, T. Hatta, A. Nagao, Hiro Ito, Mitsuo Wakatsuki","doi":"10.1007/978-3-319-39817-4_21","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers in Algorithmics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-39817-4_21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
