文
论文分享
演练场
杂货铺
论文推荐
字
编辑器下载
登录
注册
Lucas Gnecco
发表
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]
Florian Yger, David B. Blumenthal, Nicolas Boria, 2021, SISAP.