id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_7jfzxcfh3bbclafu6up5tw3bmi	Zeina Abu-Aisheh	A parallel graph edit distance algorithm	2018	60	.pdf	application/pdf	14067	2059	77	graph matching problem which consists in minimizing the cost of the sequence that transforms a graph into another by means of edit operations. In this paper, a parallel algorithm for exact GED computation is proposed. Research results in the area of parallel algorithms for solving machine learning and computer vision problems have been reported in (Kumar Recently, methods to learn the matching edit cost between graphs computational complexity of matching is exponential in the number of vertices of the involved graphs (Zeng et al., 2009). To ensure that parallel threads are always busy, tree nodes have to be dispatched at run-time. load balancing strategies to divide the global workload of all threads iteratively at run-time. Dynamic load balancing algorithms bind works to threads at run-time. 4. Proposal: Parallel graph edit distance using a load balancing graph edit distance algorithm for solving pattern recognition problems, Proposal: Parallel graph edit distance using a load balancing strategy	./cache/work_7jfzxcfh3bbclafu6up5tw3bmi.pdf	./txt/work_7jfzxcfh3bbclafu6up5tw3bmi.txt