Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/sisap/GneccoBBYB21
%A Gnecco, Lucas
%A Boria, Nicolas
%A Bougleux, Sébastien
%A Yger, Florian
%A Blumenthal, David B.
%B SISAP
%D 2021
%E Reyes, Nora
%E Connor, Richard
%E Kriege, Nils M.
%E Kazempour, Daniyal
%E Bartolini, Ilaria
%E Schubert, Erich
%E Chen, Jian-Jia
%I Springer
%K dblp
%P 337-351
%T The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.
%U http://dblp.uni-trier.de/db/conf/sisap/sisap2021.html#GneccoBBYB21
%V 13058
%@ 978-3-030-89657-7
@inproceedings{conf/sisap/GneccoBBYB21,
added-at = {2021-12-15T00:00:00.000+0100},
author = {Gnecco, Lucas and Boria, Nicolas and Bougleux, Sébastien and Yger, Florian and Blumenthal, David B.},
biburl = {https://www.bibsonomy.org/bibtex/2b9ce61b85b9ec7950c4fa9ad6914e600/dblp},
booktitle = {SISAP},
crossref = {conf/sisap/2021},
editor = {Reyes, Nora and Connor, Richard and Kriege, Nils M. and Kazempour, Daniyal and Bartolini, Ilaria and Schubert, Erich and Chen, Jian-Jia},
ee = {https://doi.org/10.1007/978-3-030-89657-7_25},
interhash = {20f635c5cb9775935e2c6ed392412436},
intrahash = {b9ce61b85b9ec7950c4fa9ad6914e600},
isbn = {978-3-030-89657-7},
keywords = {dblp},
pages = {337-351},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-10T01:59:44.000+0200},
title = {The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.},
url = {http://dblp.uni-trier.de/db/conf/sisap/sisap2021.html#GneccoBBYB21},
volume = 13058,
year = 2021
}