Lucas Gnecco, N. Boria, S. Bougleux, F. Yger, David B. Blumenthal
{"title":"The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]","authors":"Lucas Gnecco, N. Boria, S. Bougleux, F. Yger, David B. Blumenthal","doi":"10.1007/978-3-030-89657-7_25","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":90051,"journal":{"name":"Similarity search and applications : proceedings of the ... International Conference on Similarity Search and Applications","volume":"28 3 1","pages":"337-351"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Similarity search and applications : proceedings of the ... International Conference on Similarity Search and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-89657-7_25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}