Our papers “The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections” and “Metric Indexing for Graph Similarity Search” have been accepted at SISAP 2021.
Two papers accepted at SISAP 2021
Our papers “The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections” and “Metric Indexing for Graph Similarity Search” have been accepted at SISAP 2021.
No menu items found.