"The Minimum Edit Arborescence Problem and Its Use in Compressing Graph ..."

Lucas Gnecco et al. (2021)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-08-03

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2107-14525
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2107-14525
Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal:
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]. CoRR abs/2107.14525 (2021)

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.