在接近最优时间内列出稀疏图中所有最大团

{"title":"在接近最优时间内列出稀疏图中所有最大团","authors":"D. Eppstein, M. Löffler, Darren Strash","doi":"10.1007/978-3-642-17517-6_36","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":341891,"journal":{"name":"Exact Complexity of NP-hard Problems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"348","resultStr":"{\"title\":\"Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time\",\"authors\":\"D. Eppstein, M. Löffler, Darren Strash\",\"doi\":\"10.1007/978-3-642-17517-6_36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":341891,\"journal\":{\"name\":\"Exact Complexity of NP-hard Problems\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"348\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Exact Complexity of NP-hard Problems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-642-17517-6_36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Exact Complexity of NP-hard Problems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-17517-6_36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}