Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2107.14525
Cited By
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]
Similarity Search and Applications (SISAP), 2021
30 July 2021
Lucas Gnecco
N. Boria
Sébastien Bougleux
Florian Yger
David B. Blumenthal
Re-assign community
ArXiv (abs)
PDF
HTML
Github
Papers citing
"The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]"
0 / 0 papers shown
No papers found
Page 1 of 0
![The Minimum Edit Arborescence Problem and Its Use in Compressing Graph
Collections [Extended Version]](https://cdn.parameterlab.de/resized-images/aHR0cHM6Ly9jZG4ucGFyYW1ldGVybGFiLmRlL3BhcGVycy8yMTA3LjE0NTI1L3BhZ2VzL3BhZ2UtMS1xODBkMzAwLmpwZw?w=256&q=75&f=webp)
