( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching.

, , и . GbRPR, том 9069 из Lecture Notes in Computer Science, стр. 77-86. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Dirk Riesen

Walter Riesen

Katharina Riesen

Cornelius Riesen

Erwin Riesen

 

Другие публикации лиц с тем же именем

Graph Classification on Dissimilarity Space Embedding., и . SSPR/SPR, том 5342 из Lecture Notes in Computer Science, стр. 2. Springer, (2008)Generalized median graph computation by means of graph embedding in vector spaces., , , , и . Pattern Recognit., 43 (4): 1642-1655 (2010)Predicting the correctness of node assignments in bipartite graph matching., и . Pattern Recognit. Lett., (2016)Graph Augmentation for Neural Networks Using Matching-Graphs., и . ANNPR, том 13739 из Lecture Notes in Computer Science, стр. 3-15. Springer, (2022)Classifier Ensembles for Vector Space Embedding of Graphs., и . MCS, том 4472 из Lecture Notes in Computer Science, стр. 220-230. Springer, (2007)A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance., , , , и . S+SSPR, том 8621 из Lecture Notes in Computer Science, стр. 83-92. Springer, (2014)Graph-Based Keyword Spotting in Historical Handwritten Documents., , и . S+SSPR, том 10029 из Lecture Notes in Computer Science, стр. 564-573. (2016)On the Relevance of Local Neighbourhoods for Greedy Graph Edit Distance., , и . S+SSPR, том 10029 из Lecture Notes in Computer Science, стр. 121-131. (2016)Suboptimal Graph Edit Distance Based on Sorted Local Assignments., , и . MCS, том 9132 из Lecture Notes in Computer Science, стр. 147-156. Springer, (2015)Cluster Ensembles Based on Vector Space Embeddings of Graphs., и . MCS, том 5519 из Lecture Notes in Computer Science, стр. 211-221. Springer, (2009)