default search action

combined dblp search
author search
venue search
publication search

ask others

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

Lucas Gnecco et al. (2021)

> Home

Details and statistics

DOI: 10.1007/978-3-030-89657-7_25

access: closed

type: Conference or Workshop Paper

metadata version: 2021-12-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sisap/GneccoBBYB21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sisap/GneccoBBYB21
Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal:
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. SISAP 2021: 337-351

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.