BibTeX record journals/corr/abs-2107-14525

download as .bib file

@article{DBLP:journals/corr/abs-2107-14525,
  author       = {Lucas Gnecco and
                  Nicolas Boria and
                  S{\'{e}}bastien Bougleux and
                  Florian Yger and
                  David B. Blumenthal},
  title        = {The Minimum Edit Arborescence Problem and Its Use in Compressing Graph
                  Collections [Extended Version]},
  journal      = {CoRR},
  volume       = {abs/2107.14525},
  year         = {2021},
  url          = {https://arxiv.org/abs/2107.14525},
  eprinttype    = {arXiv},
  eprint       = {2107.14525},
  timestamp    = {Tue, 03 Aug 2021 14:53:34 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2107-14525.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.