HGED: A Hybrid Search Algorithm for Efficient Parallel Graph Edit Distance Computation
Graph edit distance (GED) is a measure for quantifying the similarity between two graphs. Because of its flexibility and versatility, GED is widely used in many real applications. However, the main disadvantage of GED is its high computational cost. Many solutions have been proposed to speed up GED...
-д хадгалсан:
| Үндсэн зохиолч: | |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
IEEE
2020-01-01
|
| Цуврал: | IEEE Access |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://ieeexplore.ieee.org/document/9205828/ |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|