Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal. The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. In Nora Reyes, Richard Connor, Nils M. Kriege, Daniyal Kazempour, Ilaria Bartolini, Erich Schubert, Jian-Jia Chen, editors, Similarity Search and Applications - 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings. Volume 13058 of Lecture Notes in Computer Science, pages 337-351, Springer, 2021. [doi]
@inproceedings{GneccoBBYB21,
title = {The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections},
author = {Lucas Gnecco and Nicolas Boria and Sébastien Bougleux and Florian Yger and David B. Blumenthal},
year = {2021},
doi = {10.1007/978-3-030-89657-7_25},
url = {https://doi.org/10.1007/978-3-030-89657-7_25},
researchr = {https://researchr.org/publication/GneccoBBYB21},
cites = {0},
citedby = {0},
pages = {337-351},
booktitle = {Similarity Search and Applications - 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings},
editor = {Nora Reyes and Richard Connor and Nils M. Kriege and Daniyal Kazempour and Ilaria Bartolini and Erich Schubert and Jian-Jia Chen},
volume = {13058},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-89657-7},
}