S. Aridhi, Laurent d'Orazio, Mondher Maddouri, E. M. Nguifo
{"title":"Un partitionnement basé sur la densité de graphe pour approcher la fouille distribuée de sous-graphes fréquents","authors":"S. Aridhi, Laurent d'Orazio, Mondher Maddouri, E. M. Nguifo","doi":"10.3166/tsi.33.711-737","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":109795,"journal":{"name":"Tech. Sci. Informatiques","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tech. Sci. Informatiques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3166/tsi.33.711-737","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
