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...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
IEEE
2020-01-01
|
| Col·lecció: | IEEE Access |
| Matèries: | |
| Accés en línia: | https://ieeexplore.ieee.org/document/9205828/ |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|