Graph Edit Distance Compacted Search Tree

Simple item page
dc.contributor.authorChegrane, Ibrahim
dc.contributor.authorHocine, Imane
dc.contributor.authorYahiaoui, Saïd
dc.contributor.authorBendjoudi, Ahcene
dc.contributor.authorNouali_Taboudjemat, Nadia
dc.date.accessioned2023-01-24T13:13:25Z
dc.date.available2023-01-24T13:13:25Z
dc.date.issued2022
dc.description.abstractWe propose two methods to compact the used search tree during the graph edit distance (GED) computation. The first maps the node information and encodes the different edit operations by numbers and the needed remaining vertices and edges by BitSets. The second represents the tree succinctly by bit-vectors. The proposed methods require 24 to 250 times less memory than traditional versions without negatively influencing the running time.
dc.identifier.isbn978-3-031-17848-1
dc.identifier.urihttps://dl.cerist.dz/handle/CERIST/952
dc.publisherSpringer, Cham
dc.relation.ispartofseriesSISAP 2022, Similarity Search and Applications; 15th International Conference, SISAP 2022, Bologna, Italy, October 5–7, 2022, Proceedings
dc.relation.pages181-189
dc.relation.placeBologna, Italy
dc.structureCalcul pervasif et mobile (Pervasive and Mobile Computing group)
dc.subjectGraph Edit Distance (GED)
dc.subjectCompacted GED search space
dc.titleGraph Edit Distance Compacted Search Tree
dc.typeConference paper
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Graph Edit Distance Compacted Search Tree - SISAP-2022.pdf
Size:
935.37 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
International Conference Papers